An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian

DOI10.1016/j.ipl.2018.01.010zbMath1476.05100OpenAlexW2792739039MaRDI QIDQ1707969

Hao Li, Jun-qing Cai, Yu-Zhong Zhang

Publication date: 4 April 2018

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

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

zbMATH Keywords

combinatorial problemsHamilton cycleimplicit degreeessential independent set2-heavy

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• An implicit degree condition for relative length of long paths and cycles in graphs
• An implicit degree condition for Hamiltonian graphs
• Implicit degree condition for Hamiltonicity of 2-heavy graphs
• New sufficient conditions for cycles in graphs
• Implicit-degrees and circumferences
• Dirac's minimum degree condition restricted to claws
• Large cycles in graphs
• A note on Hamiltonian circuits
• Hamilton cycles in implicit 2-heavy graphs
• Essential independent sets and Hamiltonian cycles
• Some Theorems on Abstract Graphs

This page was built for publication: An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian