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

DOI10.1016/J.JCTB.2016.05.009MaRDI QIDQ345079zbMATH OpenOpenAlexFDO

Authors Hong-Jian Lai, Zhi-Hong Chen, Liming 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

Hamiltonian cycleclaw-free graphCatlin's reduction methodminimum degree conditionRyjáček's closure concept

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonicity in 3-connected claw-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonian claw-free graphs involving minimum degrees
• Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
• Hamiltonicity and degrees of adjacent vertices in claw-free graphs

Cites work

• scientific article; zbMATH DE number 6604940 (Why is no real title available?)
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Claw-free graphs---a survey
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• Graph theory with applications
• Graphs without spanning closed trails
• Hamiltonian claw-free graphs involving minimum degrees
• Hamiltonian cycles in 3-connected 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
• Longest paths and cycles in K1,3-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On a closure concept in claw-free graphs
• Recent advances on the Hamiltonian problem: survey III

Cited in

(13)

• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• On cycle-nice claw-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
• Hamilton-connected claw-free graphs with Ore-degree conditions
• Hamiltonicity of claw-free graphs and Fan-type conditions
• Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• Circumferences of 3-connected claw-free graphs. II.
• Minimum implicit degree condition restricted to claws for Hamiltonian cycles
• On 3-stable number conditions in \(n\)-connected claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• Hamiltonian claw-free graphs involving minimum degrees

This page was built for publication: Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs

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