Longest cycles in regular graphs

DOI10.1016/0095-8956(85)90058-9zbMath0584.05046OpenAlexW1970713987MaRDI QIDQ1070244

Geng-Hua Fan

Publication date: 1985

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(85)90058-9

zbMATH Keywords

regular graphlongest cycle

Mathematics Subject Classification ID

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

Related Items

Cycle partitions of regular graphs ⋮ Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs ⋮ The robust component structure of dense regular graphs and applications ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Circumferences of regular claw-free graphs ⋮ Long path connectivity of regular graphs ⋮ Dominating cycles in regular 3-connected graphs ⋮ On the circumferences of regular 2-connected graphs

Cites Work

• Unnamed Item
• Hamilton cycles in regular 2-connected graphs
• Hamilton Circuits and Long Circuits
• Hamiltonian Cycles in Regular Graphs
• The binding number of a graph and its Anderson number
• Some Theorems on Abstract Graphs