The Mathematical Intelligencer

, Volume 40, Issue 1, pp 50–54 | Cite as

Using Kempe Exchanges to Disentangle Kempe Chains



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Errera. Du colorage des cartes et de quelques questions d’analysis situs. PhD thesis, Université libre de Bruxelles, 1921.Google Scholar
  2. [2]
    J. Hutchinson and S. Wagon. Kempe revisited. Amer. Math. Monthly, 105(2):170–174, 1998.MathSciNetCrossRefMATHGoogle Scholar
  3. [3]
    A. Kempe. On the geographical problem of four colors. Amer. J. Math., 2(3):193–200, 1879.MathSciNetCrossRefGoogle Scholar
  4. [4]
    J. Tilley. D-resolvability of vertices in planar graphs. J. Graph Algorithms Appl., 21(4):649–661, 2017.Google Scholar
  5. [5]
    S. Wagon. Martin Gardner’s April Fool’s Map. fall97/p840.html, October 1998.Google Scholar
  6. [6]
    R. Wilson. Four Colors Suffice. Princeton University Press, 2002.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2018

Authors and Affiliations

  1. 1.Bedford CornersUSA

Personalised recommendations