7:50 In this part u r telling that if from the graph if we remove any vertex then it's chromatic number is reducing but this need not be the case na.for instance take a bigraph there if I delete a vertex the chromatic number of G-v still remains two. But u will be able to say this if u prove that G is k critical.beacause there is a result which says if G is k critical then for any vertex v G-v is k-1 colourable.
Well this theorem was tough...but you explained it clearly...Thank you so much
Thank you
Maa'm your teaching style is mind-blowing...thank you maa'm 🙏🙏🙏🙏
Thank you
very clear and perfect explanation mam. thank you so much.
Most welcome
Excellent mam thank you
Welcome
Thank you very use ful👍👏
Should have started with a more clearly defined statement of the problem to be solved. What exactly does '5-vertex colourable' mean?
Thank you for your suggestion
Good explanation
Thank you
Mam can you please explain chavatal theorem for 2 connected graph
Thanku mam
7:50 In this part u r telling that if from the graph if we remove any vertex then it's chromatic number is reducing but this need not be the case na.for instance take a bigraph there if I delete a vertex the chromatic number of G-v still remains two.
But u will be able to say this if u prove that G is k critical.beacause there is a result which says if G is k critical then for any vertex v G-v is k-1 colourable.
Is this what we call heawoods map coloring theorem
How to proof 4 colour therom?
Sorry ma'am this is too complex for an average student. It contains too many complex terms not given in our book.
This lecture is for post graduate students