An attempt to understand the four color problem
- 1 September 1977
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 1 (3) , 193-206
- https://doi.org/10.1002/jgt.3190010304
Abstract
Is the recently obtained, computer‐aided proof of the Four Color Theorem an isolated phenomenon or is its combinatorial complexity typical for a significantly large class of mathematical problems? While it is too early to give a definite answer to this question, an informal discussion is undertaken in this article.Keywords
This publication has 7 references indexed in Scilit:
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- The existence of unavoidable sets of geographically good configurationsIllinois Journal of Mathematics, 1976
- The product of consecutive integers is never a powerIllinois Journal of Mathematics, 1975
- An existence theorem for planar mapsJournal of Combinatorial Theory, Series B, 1973
- Chromatic reduction of the triangulations Te, e = e5 + e7Journal of Combinatorial Theory, Series B, 1972
- The Reducibility of MapsAmerican Journal of Mathematics, 1913
- On the Geographical Problem of the Four ColoursAmerican Journal of Mathematics, 1879