Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid
From MaRDI portal
Publication:2904769
Recommendations
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
- Towards tight(er) bounds for the excluded grid theorem
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
- Polynomial bounds for the grid-minor theorem
- Linearity of grid minors in treewidth with applications through bidimensionality
Cited in
(18)- A new proof of the flat wall theorem
- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction
- Contraction bidimensionality of geometric intersection graphs
- Grid minors in damaged grids
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Linearity of grid minors in treewidth with applications through bidimensionality
- Contraction-bidimensionality of geometric intersection graphs
- Towards tight(er) bounds for the excluded grid theorem
- Rank-width and tree-width of \(H\)-minor-free graphs
- Coloring immersion-free graphs
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
- Low polynomial exclusion of planar graph patterns
- Tree-width and planar minors
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- Explicit linear kernels for packing problems
- Towards the graph minor theorems for directed graphs
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
- Extension complexity of the correlation polytope
This page was built for publication: Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904769)
