The Four-Color Problem

E2102326 UNEXPLORED

The Four-Color Problem is a classic graph theory and topology problem that asks whether any map can be colored with no more than four colors so that no adjacent regions share the same color, famously becoming the first major theorem proved using a computer-assisted proof.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (2)

Label	Occurrences
The Four-Color Problem canonical	2
Four Colours Suffice	1

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

Øystein Ore → notableWork → The Four-Color Problem ⓘ

Øystein Ore → wrote → The Four-Color Problem ⓘ

Robin J. Wilson → hasWritten → Four Colours Suffice ⓘ

linked to: The Four-Color Problem