Vertex Colorings and the Chromatic Number of Graphs | Graph Theory

Thank you so much for this wonderful explanation! Graph coloring appears vague to me in lectures. Thanks to your explanation, I have a much clear idea of it and better prepare for my coming discrete mathematics final exam! 🙂

So well explained
Very helpful 😍👍

Hey shawn, can i ask, what software are you using to do all of this? Is it OBS on a computer, or are you capturing on the ipad itself?

Thanks a lot you really explained wonderfully so easy to understand.

Thank u!

Thanks

hi everybody, is there a video about interval graphs?

Could you please do a video on what is math and what are the things we can do with the help of math?

Does someone know the outro song of this video? The musician is called vallow but i can not find the song...

Can you also give explanation for how to prove that a graph cannot be colored with less that k colors?

Do lecture on how to calculate the chromatic number for a graph

Thank u so much! I finished my activity in 3 min after watching your vid. U the best

Wonderful video man, thank you. Great explanations, thorough but not too dense, you are easy to understand.

Awesome. Thanks a ton.

good, clear explanation.thanks

Thank you idol!

Hello, how many chromatic number of (c7) power 2 ????

Please upload a video about edge colouring

Thanks a lot ! So well explained !

how about the point that dont connect to any other point? what should i color it? a different color that no point got it? or same as any point color?

Ik1w09

👍👍👍👍

can you please make a video about list coloring

Thank you so much!!!

make a video on WAGNER theorem and line graphs
also show line graph of a cycle is a cycle

THANK YOU!!!😄😊

Hi, I'm from Italy and your videos about discrete mathematics are very helpful, thank you!

Thank you for making this

Tq for explaining it so well❣️❣️🙏

Hello! Thank you once again for your amazing videos & explanations! Here I am, struggling with two other Graph Theory problems & I was hoping you could enlighten me 😅
First one: show that a planar graph of order n > 2 ( n = number of vertices) contains no more than 3n - 6 edges.
Second one: G is an undirected graph of order n. Show that 𝜒(𝐺)𝜒(𝐺̅) ≤ (𝑛 + 1)^2 / 4. ( 𝜒(𝐺) - the chromatic number of the graph, 𝜒(𝐺̅) - the chromatic number of the complement graph, n - the number of vertices).
Thank you in advance, have a lovely day!

Please could you do a video on how to do this?
For each positive integer n prove by induction that a graph G of chromatic number n contains Kn as a subgraph