The circumference of a graph with no K₃,t-minor
From MaRDI portal
Publication:859611
DOI10.1016/J.JCTB.2006.02.006zbMATH Open1111.05052OpenAlexW2148375186MaRDI QIDQ859611FDOQ859611
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
Recommendations
- The circumference of a graph with no \(K_{3,t}\)-minor. II
- The circumference of a class of \(3\)-connected graphs
- Publication:5753979
- On the circumference of 3-connected graphs
- scientific article
- scientific article
- On the circumference of 3-connected cubic triangle-free plane graphs
- Degree bounds for the circumference of 3‐connected graphs
- On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs
- scientific article
Cites Work
- Typical subgraphs of 3- and 4-connected graphs
- A Theorem on Planar Graphs
- 4-connected projective planar graphs are Hamiltonian
- Simple paths on polyhedra
- Disjoint paths, planarizing cycles, and spanning walks
- A theorem on paths in planar graphs
- Title not available (Why is that?)
- Shortness exponents of families of graphs
- Long cycles in 3-connected graphs
- Long cycles in 3‐connected graphs in orientable surfaces
- Polytopes, graphs, and complexes
- 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
- \(K_{a,k}\) minors in graphs of bounded tree-width
- Title not available (Why is that?)
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- Hamilton paths in toroidal graphs
- Longest cycles in 3-connected planar graphs
Cited In (6)
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- The circumference of a graph with no \(K_{3,t}\)-minor. II
- Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord
- A characterization of \(K_{2,4}\)-minor-free graphs
- 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
This page was built for publication: The circumference of a graph with no \(K_{3,t}\)-minor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859611)
