Chromatic Number of Bipartite Graphs | Graph Theory

[@investortalks_pt]

You don't have a clue of how much you're helping me pass my exam in Graphs XD, thank you for your dedication and atention to people like me XD in your videos!!

[@PunmasterSTP]

How'd the rest of your class go?

[@valeriereid2337]

This is very helpful, thank you.

[@bilbobaggins819]

Find chromatic polynomials for: a. K1,3 How do I solve it?

[@bytecode5834]

Thanks for the gift Sean

[@sasa-nz1le]

Thank you so much for making such a wonderful videos on Graph Theory ! :-) I wonder, if you could make video about real usage of graph theory. For example I read that planar graphs are good for designing printed connections, I would like to hear another examples, with your amazing explanation please :-)

[@AThagoras]

A minor point , but surely, the chromatic number of the null graph is 0? Graphs with more than 1 vertex and zero edges have chromatic number 1. This is consistent with the chromatic number of the complete graph being equal to the number of vertices.

[@PunmasterSTP]

This video was 2 cool!

[@sheenxavier9058]

Sir, Can you please explain what is dynamics? and where did they used in real life?

[@hardikkumar555]

what about the complete bipartite graph ?

[@vgil80]

Hi can you do a video on Chromatic Polynomial?

[@WrathofMath]

Thanks for watching and the request! I'd really love to, that's a fascinating topic! It probably won't be soon, but I will make one eventually, time is tight these days. In the meantime, if you haven't already - check out my other graph theory videos in my playlist: kzbin.info/aero/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH

[@nitinpartha5883]

so the chromatic number of bipartite Kmn graph is 2 aswell?

[@WrathofMath]

Correct, every nonempty bipartite graph has chromatic number 2.