quasi
Posts:
11,066
Registered:
7/15/05


Re: A New Graph Coloring Conjecture.
Posted:
Jun 27, 2013 5:17 PM


bill wrote:
>Conjecture: > >Every non 4color planar graph contains at least one subset >isomorphic to F5S.
There's no such thing a non4colorable planar graph.
By the 4color theorem, every planar graph is 4colorable.
quasi

