Graph Minors I: A Short Proof of the Path-width Theorem
From MaRDI portal
Publication:4844487
DOI10.1017/S0963548300001450zbMath0829.05039OpenAlexW2088373372MaRDI QIDQ4844487
Publication date: 7 January 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300001450
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (10)
Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ Seymour's conjecture on 2-connected graphs of large pathwidth ⋮ A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem ⋮ 2-Layer Graph Drawings with Bounded Pathwidth ⋮ Obstructions for linear rank-width at most 1 ⋮ Excluded Forest Minors and the Erdős–Pósa Property ⋮ Graph minor hierarchies ⋮ Directed Path-Decompositions ⋮ Forcing large transitive subtournaments ⋮ EH-suprema of tournaments with no nontrivial homogeneous sets
Cites Work
This page was built for publication: Graph Minors I: A Short Proof of the Path-width Theorem
