Recognizing Hole-Free 4-Map Graphs in Cubic Time
- First Online:
- Cite this article as:
- Chen, ZZ., Grigni, M. & Papadimitriou, C. Algorithmica (2006) 45: 227. doi:10.1007/s00453-005-1184-8
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.