Solution of the Heawood Map-Coloring Problem
โ Scribed by Gerhard Ringel and J. W. T. Youngs
- Book ID
- 123648252
- Publisher
- National Academy of Sciences
- Year
- 1968
- Tongue
- English
- Weight
- 266 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0027-8424
- DOI
- 10.2307/58488
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In his well-known paper of 1890 where he demolished Kempe's 'proof' for the four-colour theorem P.J. Heawood showed that the empires of every multimap (a map whose face set is partitioned into empires) can be coloured by 6r colours if r is the maximal number of faces belonging to some empire. He con
In the summer of 1976 Kenneth Appel and Wolfgang Haken of the University of Illinois announced that they had solved the Four-Color Problem. Suddenly what had been known to several generations of mathematicians as the Four-Color Conjecture had become the Four-Color Theorem.Since it had been a conject