Discrete Math II - 10.8.1 Graph Coloring

[@kumabear2320]

last example, it should be lamda-1 on C ??

[@NFSdrift8906]

The first example is wrong, it can be completed using 3 colours, A and E can be the same colour, D and B can be the same colour, leaving C to be the third colour

[@ganeshgump5034]

I was also distracted by that lol

[@punditgi]

Coloring is cool! 😎

[@williamjones3313]

Are you familiar with the conjecture that a 4-colorable graph is the union of 6 (six) bipartite graphs?

[@bjornolsson9103]

This was great thank you! Do you have any video about chromatic polynomial using graph decomposition?

[@SawFinMath]

I don’t. I’m sorry!

[@TahaAliKhan-mu1zk]

​@@SawFinMath No worries Kimberly

[@nsudhir_here]

Could you please make a video on n-queens problem using satisfiability concept?

[@DavittN1]

in first question if we colore D green and E yellow would't that be a minimum number of colors used?

[@comedyboy3118]

2nd example is wrong of chromatic topic mam

[@SawFinMath]

What is incorrect?

[@Fadhelalmalki]

@@SawFinMath yeah true , it can be lemda in c then lemda-2 in d

[@massivepunch6249]

Last example answer is 720 but thanks for the video i couldnt do it if you didnt teach me

[@prori5297]

I believe it's 600