Longest Cycles in 3-Connected 3-Regular Graphs

DOI10.4153/CJM-1980-076-2zbMath0454.05043WikidataQ56603447 ScholiaQ56603447MaRDI QIDQ3901549

J. A. Bondy, Miklós Simmonovits

Publication date: 1980

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

zbMATH Keywords

longest cycleslongest paths

Mathematics Subject Classification ID

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

Related Items (15)

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

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