I. Cahit. A Victorian Age Proof of the Four Color Theorem

Natural Sciences / Mathematics / Combinatorics

Submitted on: Jun 18, 2012, 17:25:47

Description: In this paper we have investigated some old issues concerning four color map problem. We have given a general method for constructing counter-examples to Kempe's proof of the four color theorem and then show that all counterexamples can be rule out by re-constructing special 2-colored two paths decomposition in the form of a double-spiral chain of the maximal planar graph. In the second part of the 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.

The abstract of this article has been published in the "Intellectual Archive Bulletin" , June 2012, ISSN 1929-1329.

The Library and Archives Canada reference page: collectionscanada.gc.ca/ourl/res.php?url_ver=Z39.88......

To read the article posted on Intellectual Archive web site please click the link below.


© 2011-2017 Shiny World Corp. All rights reserved. To reach us please send an e-mail to support@IntellectualArchive.com