Embedding grids in surfaces
From MaRDI portal
Publication:1883290
DOI10.1016/j.ejc.2003.07.007zbMath1050.05035OpenAlexW2033843939MaRDI QIDQ1883290
Gelasio Salazar, R. Bruce Richter, James F. Geelen
Publication date: 4 October 2004
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2003.07.007
Related Items (12)
Stars and Bonds in Crossing-Critical Graphs ⋮ Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ Crossing-number critical graphs have bounded path-width ⋮ Spanners in sparse graphs ⋮ On degree properties of crossing-critical families of graphs ⋮ Parameterized complexity of the spanning tree congestion problem ⋮ Crossing-critical graphs with large maximum degree ⋮ Contraction obstructions for treewidth ⋮ Infinite families of crossing-critical graphs with prescribed average degree and crossing number ⋮ Stars and bonds in crossing-critical graphs ⋮ The Parameterized Complexity of Graph Cyclability ⋮ Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Cites Work
- Generating locally-cyclic triangulations of surfaces
- A Menger-like property of tree-width: The finite case
- Irreducible triangulations of surfaces
- Highly connected sets and the excluded grid theorem
- A simpler proof of the excluded minor theorem for higher surfaces
- Crossing-number critical graphs have bounded path-width
- Branch-width and well-quasi-ordering in matroids and graphs.
- Systems of curves on surfaces
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Embedding grids in surfaces