A Victorian Age Proof of the Four Color Theorem
Ibrahim Cahit · AIP conference proceedings · 2010
In this paper we have given an algorithmic proof of the four color theorem which is based only on the coloring faces (regions) of a cubic planar maps. Our algorithmic proof has been given in three steps. The first two steps are the maximal mono‐chromatic and then maximal dichromatic coloring of the faces in such a way that the resulting uncolored (white) regions of the incomplete two‐colored map induce no odd‐cycles so that in the (final) third step four coloring of the map has been obtained almost trivially.