Longest cycles in 3-connected planar graphs

DOI10.1016/0095-8956(92)90058-6zbMath0696.05031OpenAlexW2078845719MaRDI QIDQ910413

Nicholas C. Wormald, Bill Jackson

Publication date: 1992

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

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90058-6

zbMATH Keywords

lower boundslength3-connectedplanar graphlongest cyclecyclically 4-connected

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (14)

The circumference of a graph with no \(K_{3,t}\)-minor ⋮ Tutte cycles in circuit graphs ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ Graphs with large maximum degree containing no odd cycles of a given length ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ Sufficient Conditions for 2-Dimensional Global Rigidity ⋮ Toughness in graphs -- a survey ⋮ Longer cycles in essentially 4-connected planar graphs ⋮ On the Circumference of Essentially 4-connected Planar Graphs ⋮ Circumference of essentially 4-connected planar triangulations ⋮ Long cycles in graphs on a fixed surface ⋮ Long cycles in 3-connected graphs ⋮ Tutte paths and long cycles in circuit graphs

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