Longest Cycles in 3-Connected 3-Regular Graphs

DOI10.4153/CJM-1980-076-2MaRDI QIDQ3901549zbMATH OpenWikidataFDO

Authors J. A. Bondy, Miklós Simonovits

Publication date 1980

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1980-076-2

zbMATH Keywords

longest cycleslongest paths

Mathematics Subject Classification ID

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

Cited in

(16)

• Longest cycles in 3-connected cubic graphs
• Computer observations of cycles in cubic graphs
• Longest cycles in r-regular r-connected graphs
• On the number of cycles in 3-connected cubic graphs
• Circumference of 3-connected cubic graphs
• Shortness coefficient of cyclically 4-edge-connected cubic graphs
• Toughness in graphs -- a survey
• Dual circumference and collinear sets
• Cubic graphs with large circumference deficit
• On r-regular r-connected non-hamiltonian graphs
• A shortness exponent forr-regularr-connected graphs
• Balanced generic circuits without long paths
• Dual circumference and collinear sets
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Length of cycles in generalized Petersen graphs
• Edge decomposition of connected claw-free cubic graphs

This page was built for publication: Longest Cycles in 3-Connected 3-Regular Graphs

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