## Abstract This paper is written in the spirit of the author's book: __Map Color Theorem__ (1974). We try to develop the Map Color Theorem in a combinatorial way, circumventing the unwieldy embedding theory. Similar (but not identical) generalizations have recently and independently been developed
The four-color theorem for small maps
β Scribed by Walter Stromquist
- Book ID
- 107884044
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 727 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is proved that the choice number of every graph G embedded on a surface of Euler genus Ξ΅ β₯ 1 and Ξ΅ = 3 is at most the Heawood number H(Ξ΅) = (7 + β 24Ξ΅ + 1)/2 and that the equality holds if and only if G contains the complete graph K H(Ξ΅) as a subgraph.
## Abstract A major event in 1976 was the announcement that the Four Color Conjecture (4CC) had at long last become the Four Color Theorem (4CT). The proof by W. Haken, K. Appel, and J. Koch is published in the __Illinois Journal of Mathematics__, and their twoβpart article outlines the nature and