Longest cycles in 3-connected graphs

DOI10.1016/S0012-365X(96)00008-8zbMath0905.05042MaRDI QIDQ1363662

O. Diekmann

Publication date: 10 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (6)

Degree sum conditions on two disjoint cycles in graphs ⋮ Longest cycles in 4-connected graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Algorithms for long paths in graphs ⋮ Algorithm for two disjoint long paths in 2-connected graphs ⋮ Spanning trees with a bounded number of leaves

Cites Work

• Hamiltonism, degree sum and neighborhood intersections
• Hamiltonian paths and hamiltonian connectivity in graphs
• Extremal problems involving neighborhood unions
• An improvement of fraisse's sufficient condition for hamiltonian graphs

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