
Re: A New Graph Coloring Conjecture.
Posted:
Jun 19, 2013 4:23 PM


On Tuesday, June 18, 2013 3:14:41 PM UTC7, bill wrote: > Conjecture: A graph is fourcolorable, if it does not contain a complete K5 sub graph.
Suppose I caveat no vertices with degree < 5?
Bill,

