Longest cycles in 3-connected graphs

DOI10.1016/S0012-365X(96)00008-8MaRDI QIDQ1363662zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 568790
• On the circumference of 3-connected graphs
• Relative length of longest paths and cycles in 3-connected graphs

Cites work

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

Cited in

(17)

• Bridges of longest cycles
• On cycles in 3-connected graphs
• Spanning trees with a bounded number of leaves
• Algorithm for two disjoint long paths in 2-connected graphs
• On the circumference of 3-connected graphs
• Degree sum conditions on two disjoint cycles in graphs
• scientific article; zbMATH DE number 108282 (Why is no real title available?)
• Longest cycles in 3-connected planar graphs
• scientific article; zbMATH DE number 15353 (Why is no real title available?)
• Long cycles in 3-connected graphs
• Longest cycles in 4-connected graphs
• Relative length of longest paths and cycles in 3-connected graphs
• Algorithms for long paths in graphs
• Long cycles passing through a specified edge in 3-connected graphs
• Longest cycles in 3-connected graphs contain three contractible edges
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Long cycles in 3‐connected graphs in orientable surfaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363662)