Date: Jun 19, 2013 11:45 PM
Author: quasi
Subject: Re: A New Graph Coloring Conjecture.

bill wrote:

>Much simpler! Take a set of 4 MA vertices.

What are MA vertices?

>Then connect vertex 5 to each of the first four.

No.

Any non-complete graph with 5 vertices is 4-colorable.

quasi