Pages that link to "Item:Q2284742"
From MaRDI portal
The following pages link to Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742):
Displaying 11 items.
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Grid induced minor theorem for graphs of small degree (Q2692786) (← links)
- Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid (Q2904769) (← links)
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality (Q2921728) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)
