Date: Jun 21, 2013 5:39 AM
Author: quasi
Subject: Re: A New Graph Coloring Conjecture.

bill wrote:
>quasi wrote:
>>
>> Any non-complete graph with 5 vertices is 4-colorable.

>
>What if the graph is non-planar?


All non-complete graphs with exactly 5 vertices are planar.

quasi