Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
Proceedings of the forty-sixth annual
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.