Recognizing Hole-Free 4-Map Graphs in Cubic Time

Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou

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