Circumferences and minimum degrees in 3-connected claw-free graphs

DOI10.1016/J.DISC.2007.12.062zbMath1229.05180OpenAlexW2099148003MaRDI QIDQ1025552

Yongrui Cui, Xu Yuan, Yuan Tian, He Jiang, Ming-Chu Li, Limning Xiong

Publication date: 19 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.062

zbMATH Keywords

claw-free graphcircumferenceminimum degree3-connectedness

Mathematics Subject Classification ID

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

Related Items (5)

Circumferences of 3-connected claw-free graphs ⋮ Circumferences of 3-connected claw-free graphs. II. ⋮ Circumferences of 2-factors in claw-free graphs ⋮ Hamiltonian claw-free graphs involving minimum degrees ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs

Cites Work

• Unnamed Item
• On a closure concept in claw-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
• Longest paths and cycles in K1,3-free graphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Hamiltonian connectedness in claw-free graphs

This page was built for publication: Circumferences and minimum degrees in 3-connected claw-free graphs