The following pages link to Forbidden graphs for tree-depth (Q412288):
Displaying 19 items.
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q777436) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Uniqueness and minimal obstructions for tree-depth (Q898117) (← links)
- On 1-uniqueness and dense critical graphs for tree-depth (Q1752669) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- On the tree-depth and tree-width in heterogeneous random graphs (Q2102520) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- On the tree-depth of random graphs (Q2442213) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- Improved Bounds for the Excluded-Minor Approximation of Treedepth (Q4990393) (← links)
- (Q5075772) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
