Construct · 1 fields · 1 citations

four color theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
four colortheorem1 CONSTRUCTFour color theoremAPPEL · GRAPH THEORY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

the result, first proved with computer checking, that the regions of any planar map can be colored with four colors so neighbors differ.

In graph theory, four color theorem refers to the result, first proved with computer checking, that the regions of any planar map can be colored with four colors so neighbors differ. This meaning comes from Appel (1977) in Illinois Journal of Mathematics.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how four color theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

color4 fields · 5 citationsjingle · one word, four constructs

References

  1. Appel, K., & Haken, W. (1977). Every planar map is four colorable. Part I: Discharging. Illinois Journal of Mathematics, 21(3). https://doi.org/10.1215/ijm/1256049011

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct