\(K_{a,k}\) minors in graphs of bounded tree-width
From MaRDI portal
Publication:1850628
DOI10.1006/jctb.2002.2119zbMath1024.05081OpenAlexW2084271071MaRDI QIDQ1850628
Bojan Mohar, Thomas Böhme, John Maharry
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2002.2119
Related Items (7)
The circumference of a graph with no \(K_{3,t}\)-minor ⋮ Some recent progress and applications in graph minor theory ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ \(K_{6}\) minors in 6-connected graphs of bounded tree-width ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction ⋮ Linear connectivity forces large complete bipartite minors
Cites Work
- Typical subgraphs of 3- and 4-connected graphs
- Graph minors. IX: Disjoint crossed paths
- A characterization of graphs with no cube minor
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Highly linked graphs
- An excluded minor theorem for the octahedron
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(K_{a,k}\) minors in graphs of bounded tree-width
