Edge Colorings and Chromatic Index of Graphs | Graph Theory
ฝัง
- เผยแพร่เมื่อ 11 ก.ค. 2024
- 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? • What are Adjacent Edge...
Matchings: • Matchings, Perfect Mat...
Vertex Colorings and Chromatic Numbers: • Vertex Colorings and t...
Graph Theory playlist: • Graph Theory
★DONATE★
◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits: / wrathofmathlessons
◆ Donate on PayPal: 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: crayonangel.bandcamp.com/
Follow Wrath of Math on...
● Instagram: / wrathofmathedu
● Facebook: / wrathofmath
● Twitter: / wrathofmathedu
My Music Channel: / @emery3050
Check out my lesson on vertex coloring! th-cam.com/video/3VeQhNF5-rE/w-d-xo.html
Nice explanation! 👍
was waiting for this, thanks!
My pleasure! Thanks for watching!
Awesome 😎
Just waiting for the Vizing's theorem video, the proof of that theorem its really neat.
++
I bet it's gonna be a real Vizinger!
Nice explanation, thank you! One note: Vizing's theorem can only be used to simple graphs. (I failed my midterm, because I forgot about this :c )
Very useful video.. Thankyou
Glad to hear it, thanks for watching!
Nenga suriya fan ah?
@@rajendragoudar2961 yes.. Surya fan
Hello,
Do any one know answer for "Does there exist a 3-edge colourable graph with 10 vertices and 20 edges ?"
Sounds like an exercise question 😂
Hint: Think about the degrees of those vertices that are possible under these circumstances.
nice im using it in class rn
Thank you for watching, glad it helped!
That's cool. How'd the rest of your class go?
Is empty graph has 0 chromatic index?
Hello. Yes I suppose, since there are no edges to color.
How to proof that the crossing number of K6 is 3. Thanks!!
Oh man, another edgy lecture...
Hello,
Do any one know answer for "Does there exist a 3-edge colourable graph with 10 vertices and 20 edges ?"
From my little understanding, I don't think it exists, since an graph graph can't be 3 edge colorable
@@umarmurtala5572 Yes you are correct