Long cycles in 3-connected graphs

DOI10.1006/jctb.2002.2113zbMath1025.05036OpenAlexW1988962142WikidataQ56603446 ScholiaQ56603446MaRDI QIDQ1850624

Xingxing Yu, Guantao Chen

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/414814869ef046509754e28bf4113c4f9941592d

zbMATH Keywords

cycles3-connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (25)

Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph ⋮ The circumference of a graph with no \(K_{3,t}\)-minor ⋮ Planar Turán numbers of cycles: a counterexample ⋮ Enumerative properties of rooted circuit maps ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs ⋮ Long induced paths in minor-closed graph classes and beyond ⋮ Drawing Planar Graphs with Many Collinear Vertices ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Finding large cycles in Hamiltonian graphs ⋮ A note on 3-connected cubic planar graphs ⋮ Toughness in graphs -- a survey ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ Turing kernelization for finding long paths in graph classes excluding a topological minor ⋮ On planar greedy drawings of 3-connected planar graphs ⋮ Turing kernelization for finding long paths and cycles in restricted graph classes ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ Large Wk- or K3,t-Minors in 3-Connected Graphs ⋮ Long Paths in Random Apollonian Networks ⋮ Unnamed Item ⋮ Spanning trees in 3-connected K3,t-minor-free graphs ⋮ On longest paths and diameter in random apollonian networks ⋮ Tutte paths and long cycles in circuit graphs

Cites Work

• Longest cycles in 3-connected planar graphs
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Convex programming and circumference of 3-connected graphs of low genus
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• Shortness exponents of families of graphs
• Simple paths on polyhedra
• A Theorem on Planar Graphs
• Computing the orientable genus of projective graphs
• Trees in Polyhedral Graphs
• Unnamed Item

This page was built for publication: Long cycles in 3-connected graphs