Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs

DOI10.1016/j.jctb.2016.05.009zbMath1350.05086OpenAlexW2413683251MaRDI QIDQ345079

Hong-Jian Lai, Zhi-Hong Chen, Limning Xiong

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2016.05.009

zbMATH Keywords

claw-free graphHamiltonian cycleCatlin's reduction methodminimum degree conditionRyjáček's closure concept

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Circumferences of 3-connected claw-free graphs. II. ⋮ Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs ⋮ On cycle-nice claw-free graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Hamilton-connected claw-free graphs with Ore-degree conditions ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs ⋮ Hamiltonicity of claw-free graphs and Fan-type conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs without spanning closed trails
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• Claw-free graphs---a survey
• 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
• Recent advances on the Hamiltonian problem: survey III
• Hamiltonian claw-free graphs involving minimum degrees
• Hamiltonicity in 3-connected claw-free graphs
• Longest paths and cycles in K1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• 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
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs