Every Planar Map Is Four Colorable. Part I¶
Appel, K., & Haken, W. (1977). Every Planar Map Is Four Colorable. Part I: Discharging. Illinois Journal of Mathematics, 21(3), 429-490.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Graph Coloring
- In mathematics it is the four-color theorem, chromatic-polynomial counting, and bounds via maximum clique and degree.
This sourceProves the four-color theorem; the map/cartography coloring problem that names the pattern, with the planarity bound that also governs political districting.
- In mathematics it is the four-color theorem, chromatic-polynomial counting, and bounds via maximum clique and degree.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:a41755e22659 · see in the full table