The following pages link to Tree-width and planar minors (Q2259855):
Displaying 11 items.
- An edge variant of the Erdős-Pósa property (Q284717) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)