Recognizing Hole-Free 4-Map Graphs in Cubic Time

Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou · 2006 · Algorithmica · DOI 10.1007/s00453-005-1184-8

1 Pith paper cite this work, alongside 21 external citations. Polarity classification is still indexing.

1 Pith paper citing it

21 external citations · Crossref

open at publisher browse 1 citing papers

representative citing papers

cs.CG · 2026-05-14 · unverdicted · novelty 7.0

Deciding if a graph admits a min-1-planar drawing is NP-hard.

Showing 1 of 1 citing paper.

Min-1-Planarity is NP-Hard cs.CG · 2026-05-14 · unverdicted · none · ref 7
Deciding if a graph admits a min-1-planar drawing is NP-hard.