Proves NP-hardness of recognizing min-1-planar graphs.
Title resolution pending
1 Pith paper cite this work, alongside 21 external citations. Polarity classification is still indexing.
1
Pith paper citing it
21
external citations · Crossref
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Min-1-Planarity is NP-Hard
Proves NP-hardness of recognizing min-1-planar graphs.