Date: Jun 21, 2013 6:02 AM Author: quasi Subject: Re: A New Graph Coloring Conjecture. Zeit Geist wrote:
>>>Any non-complete graph with 5 vertices is 4-colorable.
>>What if the graph is non-planar?
>Any non-complete graph with 5 vertices that is non-planar
>requires 6 colors to color it. Or is it 0?