On Friday, June 21, 2013 2:35:20 AM UTC-7, quasi wrote: > 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
If you haven't figured it outyet, the explanation follows the
The graph IS a complete K5 graph
What would you call a graph in which every vertex is adjacent to every other vertex?