Graph Minors I: A Short Proof of the Path-width Theorem
From MaRDI portal
Publication:4844487
DOI10.1017/S0963548300001450zbMATH Open0829.05039OpenAlexW2088373372MaRDI QIDQ4844487FDOQ4844487
Authors: Reinhard Diestel 
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
Recommendations
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors: generalizing Kuratowski's theorem
- Graph minors. III. Planar tree-width
- scientific article; zbMATH DE number 3906520
- Graph minors. XIII: The disjoint paths problem
- Towards the graph minor theorems for directed graphs
- Minors in graphs of large \(\theta_r\)-girth
- Graph minors. IV: Tree-width and well-quasi-ordering
- A shorter proof of the graph minor algorithm: the unique linkage theorem
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (13)
- A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Excluded Forest Minors and the Erdős–Pósa Property
- Graph minor hierarchies
- Forcing large transitive subtournaments
- 2-Layer Graph Drawings with Bounded Pathwidth
- The excluded tree minor theorem revisited
- Seymour's conjecture on 2-connected graphs of large pathwidth
- Directed Path-Decompositions
- A shorter proof of the graph minor algorithm: the unique linkage theorem
- EH-suprema of tournaments with no nontrivial homogeneous sets
- Obstructions for linear rank-width at most 1
- On the structure of graphs with path-width at most two
This page was built for publication: Graph Minors I: A Short Proof of the Path-width Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4844487)
