Grid minors in damaged grids
From MaRDI portal
Publication:405308
zbMath1300.05292arXiv1303.1136MaRDI QIDQ405308
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.1136
Related Items (3)
Approximation Algorithms for Euler Genus and Related Problems ⋮ Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets ⋮ Characterising graphs with no subdivision of a wheel of bounded diameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Bandwidth and pathwidth of three-dimensional grids
- Polynomial treewidth forces a large grid-like-minor
- The treewidth and pathwidth of hypercubes
- On the Hadwiger's conjecture for graph products
- Linearity of grid minors in treewidth with applications through bidimensionality
- Tree-width of graphs without a \(3\times 3\) grid minor
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Graph minors. I. Excluding a forest
- Graph minors. X: Obstructions to tree-decomposition
- A partial k-arboretum of graphs with bounded treewidth
- Highly connected sets and the excluded grid theorem
- Quickly excluding a planar graph
- Combinatorial aspects of geometric graphs
- A short proof of Halin's grid theorem
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- Reconfiguring Arrays with Faults Part I: Worst-Case Faults
- Efficient erasure correcting codes
- Approximation Algorithms for Euler Genus and Related Problems
- Polynomial bounds for the grid-minor theorem
- Über die Maximalzahl fremder unendlicher Wege in Graphen
- Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
This page was built for publication: Grid minors in damaged grids
