The circumference of a graph with no \(K_{3,t}\)-minor
From MaRDI portal
Publication:859611
DOI10.1016/j.jctb.2006.02.006zbMath1111.05052OpenAlexW2148375186MaRDI QIDQ859611
Guantao Chen, Xingxing Yu, Laura Sheppardson, Wenan Zang
Publication date: 16 January 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.02.006
Related Items (5)
The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ A Characterization of $K_{2,4}$-Minor-Free Graphs ⋮ Spanning trees in 3-connected K3,t-minor-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Typical subgraphs of 3- and 4-connected graphs
- Longest cycles in 3-connected planar graphs
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- 4-connected projective planar graphs are Hamiltonian
- Convex programming and circumference of 3-connected graphs of low genus
- Five-connected toroidal graphs are Hamiltonian
- Long cycles in graphs on a fixed surface
- Long cycles in 3-connected graphs
- \(K_{a,k}\) minors in graphs of bounded tree-width
- Hamilton paths in toroidal graphs
- Shortness exponents of families of graphs
- Simple paths on polyhedra
- Disjoint paths, planarizing cycles, and spanning walks
- A Theorem on Planar Graphs
- Long cycles in 3‐connected graphs in orientable surfaces
- Polytopes, graphs, and complexes
- A theorem on paths in planar graphs
This page was built for publication: The circumference of a graph with no \(K_{3,t}\)-minor
