Indexed metadata

Every planar map is four colorable. Part II: Reducibility

K. Appel, W. Haken, J. Koch

Source record

Source: Crossref

Published: Sep 1, 1977

DOI: 10.1215/ijm/1256049012

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Every planar map is four colorable. Part II: Reducibility — Mathematical Frontier Network