The circumference of a graph with no \(K_{3,t}\)-minor. II

DOI10.1016/j.jctb.2012.07.003zbMath1256.05228OpenAlexW4206040971MaRDI QIDQ1931398

Xingxing Yu, Wenan Zang, Guantao Chen

Publication date: 14 January 2013

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.2012.07.003

zbMATH Keywords

connectivitygraph minorcircumferencepath and cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Connectivity (05C40)

Related Items (5)

Minimal \(k\)-connected non-Hamiltonian graphs ⋮ Turing kernelization for finding long paths in graph classes excluding a topological minor ⋮ Turing kernelization for finding long paths and cycles in restricted graph classes ⋮ Large Wk- or K3,t-Minors in 3-Connected Graphs ⋮ Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor

Cites Work

• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Typical subgraphs of 3- and 4-connected graphs
• The circumference of a graph with no \(K_{3,t}\)-minor
• Longest cycles in 3-connected planar graphs
• Contractible edges in 3-connected graphs
• 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
• Graph minor theory
• Long cycles in 3‐connected graphs in orientable surfaces

This page was built for publication: The circumference of a graph with no \(K_{3,t}\)-minor. II