The DOI matches its Crossref record.
Every planar map is four colorable
Open accessAbstract
The following theorem is proved.THEOREM .Every planar map can be colored with at most four colors. AMS (MOS) subject classifications (1970). Primary05C15. 1 This work appears in full in two papers, Every planar map is four colorable; part I, Discharging, by K. Appel and W. Haken and part II, Reducibility, by K. Appel, W. Haken,
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
Robertson, N., Sanders, D., Seymour, P., & Thomas, R. (1997) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1997.1750 · Cited by 598
An Introduction to Variable Neighborhood Search
Hansen, P., & Mladenović, N. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_30 · Cited by 340
A Machine-Checked Proof of the Odd Order Theorem
Gonthier, G., Asperti, A., Avigad, J., Bertot, Y., Cohen, C., Garillot, F., Le Roux, S., Mahboubi, A., O’Connor, R., Ould Biha, S., et al. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39634-2_14 · Cited by 290
Metadata
- Authors
- Appel, K., & Haken, W.
- Venue
- Bulletin of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1976
- Volume
- 82
- Issue
- 5
- Pages
- 711-712
- ISSN
- 0002-9904 (ISSN-L)
- 0273-0979
- 1088-9485
- OpenAlex
- W2148360835
- Cited by
- 1,109
- References
- 0
- FWCI
- 7.51
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Every planar map is four colorable. https://app.cochat.ai/papers/10.1090/s0002-9904-1976-14122-5
- The paper
- Appel, K., & Haken, W. (1976). Every planar map is four colorable. Bulletin of the American Mathematical Society. https://doi.org/10.1090/s0002-9904-1976-14122-5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.