How is proving that any planar graph with maximum degree of four has a four coloring, different from proving the four color theorem? If they are different, then how would one prove it?
$\begingroup$
$\endgroup$
3
-
$\begingroup$ ummmm.... they're different because there are planar graphs with maximum degree exceeding 4. $\endgroup$– Anthony QuasFeb 12, 2016 at 7:48
-
$\begingroup$ @AnthonyQuas So is my statement much easier to prove than the four coloring theorem? $\endgroup$– user86566Feb 12, 2016 at 22:04
-
$\begingroup$ Yes it is a LOT easier, for instance using Brook's Theorem. See en.wikipedia.org/wiki/Brooks%27_theorem $\endgroup$– Manuel LafondFeb 13, 2016 at 2:19
Add a comment
|