
Re: A New Graph Coloring Conjecture.
Posted:
Jun 22, 2013 8:26 PM


On Friday, June 21, 2013 2:35:20 AM UTC7, quasi wrote: > bill wrote: > > >quasi wrote: > > >> > > >> Any noncomplete graph with 5 vertices is 4colorable. > > > > > >What if the graph is nonplanar? > > > > All noncomplete graphs with exactly 5 vertices are planar. > > > > quasi
If you haven't figured it outyet, the explanation follows the
Spoiler alert
The graph IS a complete K5 graph
What would you call a graph in which every vertex is adjacent to every other vertex?

