Edge Coloring and Chromatic Number in Graph | Graph Theory | By :- Harendra Sharma

[@imdangerbkt8429]

Today is my exam I have only one doubt now clear thank you so much sir ❤ Fri 14 june 2024 .12:57 AM

[@sk12233]

Nice explanation sir tqsm 🙏

[@SohansinghSohansingh-sn5sp]

best explanation 😊

[@SharifulIslam-rw4kx]

Really amazing.

[@rakeshkumar-nm6lm]

Nice explanation 🙏

[@manishachouhan7060]

Thank you sir 🎉

[@captainhaddock1614]

so for even no of vertices(n) complete graph edge chromatic number = n-1 ?

[@yahyaahmad7378]

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

[@om0856]

​@@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 😊

[@elizabethvaz4082]

Can u mk a video for proof of Adding an edge to a graph increases the chromatic number by atmost 1

[@ankitbisht5274]

na

[@user-34-hji-jsnsh-638bdje]

Thank you sir

[@sonu_ganni]

Thanks sir

[@nikitasinha8181]

Thank you

[@wafaafatimaofficial466]

Thnks you sir

[@RakibHossain-jh5bm]

Thx

[@maheenjawaid7641]

Na koi formula btaya

[@manishachouhan7060]

Thank you sir 🎉

[@youniswani5555]

Thank you sir