Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
Reachability in K_ 3,3 -free G raphs and K_5 - free Graphs is in Unambiguous Logspace
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 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.