# Four-Color Maps

Initializing live version

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

For 66 years, research on the four-color theorem was dominated by Tait's Hamiltonian graph conjecture: any cubic polyhedral graph has a Hamiltonian cycle. In a graph, cubic means that every vertex is incident with exactly three edges. Any planar graph can be made cubic by drawing a small circle around any vertex with valence greater than three and eliminating the original vertex. Tutte, in 1946, found the first counterexample to Tait's conjecture.

[more]
Contributed by: Ed Pegg Jr (January 2008)

Open content licensed under CC BY-NC-SA

## Details

## Snapshots

## Permanent Citation