Edge Colorings and Chromatic Index of Graphs | Graph Theory

We introduce edge colorings of graphs and the edge chromatic number of graphs, also called the chromatic index. We'll talk about k-colorings/k-edge colorings, minimum edge colorings, edge colourings as matchings, edge colourings as functions, and see examples and non-examples of edge colorings. #GraphTheory

An edge coloring of a graph (sometimes proper edge coloring) is an assignment of colors to the edges of a graph such that adjacent edges are colored differently.

What are Adjacent Edges? https://youtu.be/i4yoI84gwgc
Matchings: https://youtu.be/chdr2aj4FUc
Vertex Colorings and Chromatic Numbers: https://youtu.be/3VeQhNF5-rE

Graph Theory playlist: https://www.youtube.com/playlist?list=PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH

★DONATE★
◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits: https://www.patreon.com/join/wrathofmathlessons
◆ Donate on PayPal: https://www.paypal.me/wrathofmath

Thanks to Robert Rennie, Barbara Sharrock, and Rolf Waefler for their generous support on Patreon!

Thanks to Crayon Angel, my favorite musician in the world, who upon my request gave me permission to use his music in my math lessons: https://crayonangel.bandcamp.com/

Follow Wrath of Math on...
● Instagram: https://www.instagram.com/wrathofmathedu
● Facebook: https://www.facebook.com/WrathofMath
● Twitter: https://twitter.com/wrathofmathedu

My Music Channel: https://www.youtube.com/channel/UCOvWZ_dg_ztMt3C7Qx3NKOQ

Видео Edge Colorings and Chromatic Index of Graphs | Graph Theory канала Wrath of Math