- 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.
NEAR EAST UNIVERSITY GRAND LIBRARY +90 (392) 223 64 64 Ext:5536. Near East Boulevard, Nicosia, TRNC This software is developed by NEU Library and it is based on Koha OSS
conforms to MARC21 library data transfer rules.