Coloring Planar Maps

  • Stan Wagon


Often a careful look at an old idea from a modern point of view can lead to some interesting developments. In this chapter, we use Mathematica to illustrate several aspects of the four-color theorem, for both maps and graphs. As a consequence, we obtain a randomized algorithm based on Kempe’s 1879 “proof” of the four-color theorem. The algorithm seems to work quite well; the illustration shows a 4-color-ing of the map consisting of 3093 U.S. counties.


Planar Graph Degree Sequence Adjacency Graph Graph Object Adjacency List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Stan Wagon
    • 1
  1. 1.Department of Mathematics and Computer ScienceMacalester CollegeSt. PaulUSA

Personalised recommendations