Hamilton cycles in implicit claw-heavy graphs

DOI10.1016/j.ipl.2014.06.007zbMath1358.05169OpenAlexW2131751743MaRDI QIDQ402356

Xing Huang

Publication date: 28 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.007

zbMATH Keywords

combinatorial problemsHamiltonian cycleimplicit degreeimplicit claw-heavy

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (3)

Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• New sufficient conditions for cycles in graphs
• Implicit-degrees and circumferences
• Hamilton cycles in claw-heavy graphs
• Dirac's minimum degree condition restricted to claws
• Advances on the Hamiltonian problem -- a survey
• Large cycles in graphs
• An Implicit Degree Condition for Cyclability in Graphs
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs

This page was built for publication: Hamilton cycles in implicit claw-heavy graphs