k-Planarity Testing stays NP-hard and hard to approximate on graphs with tiny feedback vertex sets, while becoming fixed-parameter tractable and kernelizable under vertex cover or treedepth parameters.
20 Michael Hoffmann, Chih-Hung Liu, Meghana M
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Structural Parameterizations of $k$-Planarity
k-Planarity Testing stays NP-hard and hard to approximate on graphs with tiny feedback vertex sets, while becoming fixed-parameter tractable and kernelizable under vertex cover or treedepth parameters.