The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
The Four-Colour Theorem
Open accessOverview
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
Cites
Every planar map is four colorable
Appel, K., & Haken, W. (1976) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1976-14122-5 · Cited by 1,109
Every planar map is four colorable. Part I: Discharging
Appel, K., & Haken, W. (1977) · Illinois Journal of Mathematics · doi:10.1215/ijm/1256049011 · Cited by 884
Every planar map is four colorable. Part II: Reducibility
Appel, K., Haken, W., & Koch, J. (1977) · Illinois Journal of Mathematics · doi:10.1215/ijm/1256049012 · Cited by 704
Every Planar Map is Four Colorable
Appel, K., & Haken, W. (1989) · Contemporary Mathematics · doi:10.1090/conm/098 · Cited by 290
On the Geographical Problem of the Four Colours
Kempe, A. B. (1879) · American Journal of Mathematics · doi:10.2307/2369235 · Cited by 266
Cited by
(2005) · Choice Reviews Online · doi:10.5860/choice.42-2854b · Cited by 639
Korte, B., & Vygen, J. (2000) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21708-5_16 · Cited by 579
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
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
Reproducibility failures are essential to scientific inquiry
Redish, A. D., Kummerfeld, E., Morris, R. L., & Love, A. C. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1806370115 · Cited by 66
Metadata
- Authors
- Robertson, N., Sanders, D., Seymour, P., & Thomas, R.
- Venue
- Journal of Combinatorial Theory, Series B
- Publisher
- Elsevier BV
- Published
- 1997-05
- Volume
- 70
- Issue
- 1
- Pages
- 2-44
- ISSN
- 0095-8956 (ISSN-L)
- OpenAlex
- W2131433460
- Cited by
- 598
- References
- 5
- FWCI
- 14.18
- Type
- journal article
- Language
- en
- Open access
- bronze
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: The Four-Colour Theorem. https://app.cochat.ai/papers/10.1006/jctb.1997.1750
- The paper
- Robertson, N., Sanders, D., Seymour, P., & Thomas, R. (1997). The Four-Colour Theorem. Journal of Combinatorial Theory, Series B. https://doi.org/10.1006/jctb.1997.1750
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.
