ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
last example, it should be lamda-1 on C ??
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
I was also distracted by that lol
Are you familiar with the conjecture that a 4-colorable graph is the union of 6 (six) bipartite graphs?
in first question if we colore D green and E yellow would't that be a minimum number of colors used?
Coloring is cool! 😎
This was great thank you! Do you have any video about chromatic polynomial using graph decomposition?
I don’t. I’m sorry!
@@SawFinMath No worries Kimberly
Could you please make a video on n-queens problem using satisfiability concept?
2nd example is wrong of chromatic topic mam
What is incorrect?
@@SawFinMath yeah true , it can be lemda in c then lemda-2 in d
Last example answer is 720 but thanks for the video i couldnt do it if you didnt teach me
I believe it's 600
last example, it should be lamda-1 on C ??
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
I was also distracted by that lol
Are you familiar with the conjecture that a 4-colorable graph is the union of 6 (six) bipartite graphs?
in first question if we colore D green and E yellow would't that be a minimum number of colors used?
Coloring is cool! 😎
This was great thank you! Do you have any video about chromatic polynomial using graph decomposition?
I don’t. I’m sorry!
@@SawFinMath No worries Kimberly
Could you please make a video on n-queens problem using satisfiability concept?
2nd example is wrong of chromatic topic mam
What is incorrect?
@@SawFinMath yeah true , it can be lemda in c then lemda-2 in d
Last example answer is 720 but thanks for the video i couldnt do it if you didnt teach me
I believe it's 600