Coloring Planar Maps

Stan Wagon ()
Additional contact information
Stan Wagon: Macalester College, Department of Mathematics and Computer Science

Chapter 17 in Mathematica in Action, 2010, pp 431-472 from Springer

Abstract: Abstract 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.

Keywords: Planar Graph; Degree Sequence; Adjacency Graph; Graph Object; Adjacency List (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-75477-2_18

Ordering information: This item can be ordered from
http://www.springer.com/9780387754772

DOI: 10.1007/978-0-387-75477-2_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().