The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.
Minors of two-connected graphs of large path-width
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Let $P$ be a graph with a vertex $v$ such that $P\backslash v$ is a forest, and let $Q$ be an outerplanar graph. We prove that there exists a number $p=p(P,Q)$ such that every 2-connected graph of path-width at least $p$ has a minor isomorphic to $P$ or $Q$. This result answers a question of Seymour and implies a conjecture of Marshall and Wood. The proof is based on a new property of tree-decompositions.
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 1years
2023 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
An Overview of Universal Obstructions for Graph Parameters
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.