Date: Jun 18, 2013 6:14 PM
Author: b92057@yahoo.com
Subject: A New Graph Coloring Conjecture.

Conjecture: A graph is four-colorable, if it does not contain a complete K5 sub graph.