Edge Coloring and Chromatic Number in Graph | Graph Theory | By :- Harendra Sharma
HTML-код
- Опубликовано: 15 дек 2024
- In this lecture we are going to learn about how to color edges of a graph and how to find the chromatic number of graph.
Edge Coloring in graph
Chromatic number of graph
Edge coloring in graph with example
Chromatic number of graph with example
For more videos
Subscribe
Bhai Bhai Tutorials
By- Harendra Sharma
#EdgeColoring
#ChromaticNumber
#EdgeColoringInGraph
#ChromaticNumberOfGraph
Today is my exam I have only one doubt now clear thank you so much sir ❤ Fri 14 june 2024 .12:57 AM
Nice explanation sir tqsm 🙏
Really amazing.
Nice explanation 🙏
best explanation 😊
Thanks bro
Thank you sir 🎉
so for even no of vertices(n) complete graph edge chromatic number = n-1 ?
every vertices are adjacent to each other in complete graph, so for complete graph , chromatic no. is always n
and similary in bipartite graph chromatic number is always 2
@@yahyaahmad7378 he is asking for edge chromatic number not the vertex chromatic number. The condition which you have suggested is applied for vertex chromatic number 😊
Can u mk a video for proof of Adding an edge to a graph increases the chromatic number by atmost 1
na
Thank you sir
Thanks sir
Thnks you sir
Thank you
Thx
Na koi formula btaya
Thank you sir 🎉
Thank you sir