Hamiltonian claw-free graphs involving minimum degrees

DOI10.1016/J.DAM.2013.01.002zbMath1287.05079OpenAlexW2077296360MaRDI QIDQ2446336

Ming-Chu Li

Publication date: 16 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.01.002

zbMATH Keywords

cycleclaw-free graphminimum degree3-connectedness

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs

Cites Work

• Unnamed Item
• Circumferences and minimum degrees in 3-connected claw-free graphs
• On a closure concept in claw-free graphs
• Hamiltonian cycles in 3-connected claw-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• Hamiltonian results inK1,3-free graphs
• Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
• Hamiltonian cycles in 3‐connected claw‐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: Hamiltonian claw-free graphs involving minimum degrees