Note: A comprehensive analysis of degree based condition for Hamiltonian cycles

Authors:
Md. Kamrul Hasan;Mohammad Kaykobad;Young-Koo Lee;Sungyoung Lee
Affiliations:
Department of Computer Engineering, Kyung Hee University, South Korea;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Bangladesh;Department of Computer Engineering, Kyung Hee University, South Korea;Department of Computer Engineering, Kyung Hee University, South Korea
Venue:
Theoretical Computer Science
Year:
2010

Citing 4
Cited 1

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters
A new sufficient condition for Hamiltonicity of graphs

Information Processing Letters
An improved degree based condition for Hamiltonian cycles

Information Processing Letters
An efficient condition for a graph to be Hamiltonian

Discrete Applied Mathematics

On the 1-fault hamiltonicity for graphs satisfying Ore's theorem

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

Since finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-complete problems, researchers have been formulating sufficient conditions that ensure the path or cycle. Rahman and Kaykobad (2005) [2] presented a sufficient condition for determining the existence of Hamiltonian path. Three recent works-Lenin Mehedy, Md. Kamrul Hasan, Mohammad Kaykobad (2007) [3], Rao Li (2006) [4], Shengjia Li, Ruijuan Li, Jinfeng Feng (2007) [5]-further used the same or similar condition to ensure Hamiltonian cycle with some exceptions. The three works, along with their unique findings, have some common results. This paper unifies the results and brings them under Rahman and Kaykobad's condition.