Four-Coloring Real 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.

The four-color theorem states that any map can be colored with no more than four colors, so that no two countries sharing a border have the same color. The Brelaz algorithm, used in Mathematica's Combinatorica Package function VertexColoring, four-colors many real world maps very quickly. This Demonstration allows you to view a four-coloring of a number of different country groups. The view may be global or local and may use one of several different map projections.

Contributed by: Mark McClure (March 2011)
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.