A new invariant M_k yields the first general lower and upper bounds on the order of induced subgraphs with pathwidth at most k in outerplanar graphs.
Bodlaender, A tourist guide through treewidth,Acta cybernet.11(1993), 1–21
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.DM 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Large induced subgraph with a given pathwidth in outerplanar graphs
A new invariant M_k yields the first general lower and upper bounds on the order of induced subgraphs with pathwidth at most k in outerplanar graphs.