, Volume 45, Issue 2, pp 227-262
Date: 10 Feb 2006

Recognizing Hole-Free 4-Map Graphs in Cubic Time

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.