Longest cycles in r-regular r-connected graphs

DOI10.1016/0095-8956(82)90001-6zbMath0494.05033OpenAlexW2013151284MaRDI QIDQ1168983

Brad Jackson, T. D. Parsons

Publication date: 1982

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(82)90001-6

zbMATH Keywords

longest cyclesshortness coefficientr-connected regular graph

Mathematics Subject Classification ID

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

Related Items (2)

Graph theory (algorithmic, algebraic, and metric problems) ⋮ On hamiltonian line graphs and connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• On shortness exponents of families of graphs
• Non-Hamiltonian non-Grinbergian graphs
• Remark on a paper of J. Zaks
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Vertices missed by longest paths or circuits
• Shortness exponents of families of graphs
• Longest Cycles in 3-Connected 3-Regular Graphs
• On r-regular r-connected non-hamiltonian graphs

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