The Four-Colour Theorem¶
Robertson, N., Sanders, D., Seymour, P., & Thomas, R. (1997). The Four-Colour Theorem. Journal of Combinatorial Theory, Series B, 70(1), 2-44.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Four Color Theorem
- The theorem promises that a suitable assignment exists; a particular attempted assignment can still fail.
This sourceStates the theorem in the abstract and §1 and the finite sphere-drawing convention in §2. The inspected source is the 42-page revised author manuscript, cover February 1994, revised 16 January 1997; manuscript pp.1–3 are the locators used here, not the journal pagination. The complete computer case analysis and programs were not independently checked or executed for this account. Exact example coordinates, adjacency lists, assignments and lower bounds above are elementary author constructions.
- The theorem promises that a suitable assignment exists; a particular attempted assignment can still fail.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:d8cbde1e1c9c · see in the full table