Four-Color Maps

Initializing live version
Download to Desktop

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.


Tait's method turns a Hamiltonian cycle into a four-coloring.

1. Alternately color the edges of the cycle blue and purple. Color the other edges red. 2. Throw out red edges, and color the resulting polygon blue. 3. Throw out blue edges, and color the resulting polygon(s) red. 4. Overlay the polygons.

The method used in this Demonstration can four-color any planar map that conforms to Tait's conjecture.


Contributed by: Ed Pegg Jr (January 2008)
Open content licensed under CC BY-NC-SA



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.