4 Color Theorem is for graphs that can be realized in a plain. K25 is not a plain graph. (Any complete graph with degree higher than 5 is not a plain graph.)
i.e., you cannot color the vertex by only 4 colors without overlapping neighbors (well, isn't that obvious?) for any K(n), with n > 5 :D ..
Besides, this problem is quite different.. triangle edges' color .. :)
i.e., you cannot color the vertex by only 4 colors without overlapping neighbors (well, isn't that obvious?) for any K(n), with n > 5 :D ..
Besides, this problem is quite different.. triangle edges' color .. :)
选择“Disable on www.wenxuecity.com”
选择“don't run on pages on this domain”
