Every Planar Map is Four-Colorable

Kenneth Appel, W. H. (1989). Every Planar Map is Four-Colorable.

Type

Unclassified

Intellectual base

Unclassified

Year

1989

DOI

10.1090/conm/098

Link

https://doi.org/10.1090/conm/098

Cited by

1 citation across 1 artifact.

Domain-specific

• Snark (graph theory)
  • Authors vary on whether bridgelessness, cyclic edge-connectivity or minimum girth is built into the word; the raw cubic class-two condition and any nontriviality convention must be separated.

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:47cd9ca27a92 · see in the full table