Graph Minors I: A Short Proof of the Path-width Theorem
From MaRDI portal
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 _r-girth
- Graph minors. IV: Tree-width and well-quasi-ordering
- A shorter proof of the graph minor algorithm: the unique linkage theorem
Cited in
(16)- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Graph minor hierarchies
- Forcing large transitive subtournaments
- EH-suprema of tournaments with no nontrivial homogeneous sets
- Obstructions for linear rank-width at most 1
- Seymour's conjecture on 2-connected graphs of large pathwidth
- A shorter proof of the graph minor algorithm: the unique linkage theorem
- On the structure of graphs with path-width at most two
- A win-win algorithm for the (k+1)-LST/k-pathwidth problem
- Directed path-decompositions
- Excluded Forest Minors and the Erdős–Pósa Property
- 2-Layer Graph Drawings with Bounded Pathwidth
- The excluded tree minor theorem revisited
- Linear bounds on treewidth in terms of excluded planar minors
- Tight bound for the Erdős-Pósa property of tree minors
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)
