Pages that link to "Item:Q4844487"
From MaRDI portal
The following pages link to Graph Minors I: A Short Proof of the Path-width Theorem (Q4844487):
Displaying 12 items.
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Graph minor hierarchies (Q1764803) (← links)
- Forcing large transitive subtournaments (Q2343283) (← links)
- EH-suprema of tournaments with no nontrivial homogeneous sets (Q2349509) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- Seymour's conjecture on 2-connected graphs of large pathwidth (Q2663412) (← links)
- A shorter proof of the graph minor algorithm: the unique linkage theorem (Q2875195) (← links)
- A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem (Q5100142) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
- The excluded tree minor theorem revisited (Q6632794) (← links)
