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.
Borodin, On acyclic colorings of planar graphs,Discrete Math.25(1979), 211– 236
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 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.