Longest cycles in regular 2-connected claw-free graphs

DOI10.1016/0012-365X(93)E0142-QzbMath0814.05051OpenAlexW1989937278MaRDI QIDQ1343791

Ming-Chu Li

Publication date: 31 May 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0142-q

zbMATH Keywords

claw-free graphHamiltonian cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Claw-free graphs---a survey ⋮ Circumferences of 2-factors in claw-free graphs ⋮ Circumferences of regular claw-free graphs

Cites Work

• Hamilton cycles in regular 2-connected graphs
• Longest paths and cycles in K1,3-free graphs
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Longest cycles in regular 2-connected claw-free graphs