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

DOI10.1016/J.DISC.2007.12.062zbMATH Open1229.05180OpenAlexW2099148003MaRDI QIDQ1025552FDOQ1025552

Authors: Yongrui Cui, Yuan Tian, He Jiang, Xu Yuan, Mingchu Li, Liming 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

Recommendations

• Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
• Circumferences of 3-connected claw-free graphs
• scientific article; zbMATH DE number 1766873
• On the circumference of 3-connected quasi-claw-free graphs
• Circumferences of 3-connected claw-free graphs. II.
• scientific article; zbMATH DE number 147639
• scientific article; zbMATH DE number 1766878
• Circumferences in \(k\)-connected claw-free graphs
• Circumferences of claw-free graphs
• Circumferences of regular claw-free graphs

zbMATH Keywords

minimum degreecircumferenceclaw-free graph3-connectedness

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• On a closure concept in 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
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonian connectedness in claw-free graphs

Cited In (8)

• On cycle lengths in claw-free graphs with complete closure
• Circumferences of 3-connected claw-free graphs
• On 2-factors with long cycles in 3-connected claw-free graphs
• Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
• Circumferences of 3-connected claw-free graphs. II.
• The degree-diameter problem for claw-free graphs and hypergraphs
• Hamiltonian claw-free graphs involving minimum degrees
• Circumferences of 2-factors in claw-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025552)