
Re: A New Graph Coloring Conjecture.
Posted:
Jun 18, 2013 6:46 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.
If a graph does not contain a complete K5 subgraph then either,
1. The graph is planar.
OR
2. The graph contains a K3,3 subgraph.
So, we must prove that we can take a planar graph and append any finite number of K3,3 subgraphs and still have a four colored new graph.
This is, of couse, takes in account the fact that every planar graph is at most four colored.
ZG

