, Volume 45, Issue 2, pp 227–262 | Cite as

Recognizing Hole-Free 4-Map Graphs in Cubic Time



We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at most four countries meet at any point.

Planar graphs Maps Map graphs Cliques Graph algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-0394Japan
  2. 2.Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322USA
  3. 3.Computer Science Division, University of California at Berkeley, Berkeley, CA 94720USA

Personalised recommendations