3 ms·
Specifically: 6 - R 7 - G 1 - B 15 - B 16 - R 8 - Cannot be R G or B
by agrona 14y ago
Specifically:
6 - R
7 - G
1 - B
15 - B
16 - R
8 - Cannot be R G or B
- deleted 14y ago[deleted]
- mgallivan 14y agoIs there any way to translate between this rather visual proof and the degrees of 8's neighbouring vertices? I tried to find if there was some theory behind it but all I could really find was "saturation degree".
- ColinWright 14y agoNot really, no. There are many, many results about when something is and is not three-colorable, but in the end, graph three coloring is NP-Complete.
- mgallivan 14y agoThanks!