Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs
2014 ◽
Vol 06
(03)
◽
pp. 1450043
Let claw be the graph K1,3. A graph G on n ≥ 3 vertices is called o-heavy if each induced claw of G has a pair of end-vertices with degree sum at least n, and called 1-heavy if at least one end-vertex of each induced claw of G has degree at least n/2. In this note, we show that every 2-connected o-heavy or 3-connected 1-heavy graph is Hamiltonian if we restrict Fan-type degree condition or neighborhood intersection condition to certain pairs of vertices in some small induced subgraphs of the graph. Our results improve or extend previous results of Broersma et al., Chen et al., Fan, Goodman and Hedetniemi, Gould and Jacobson, and Shi on the existence of Hamilton cycles in graphs.
Keyword(s):
2010 ◽
Vol 24
(3)
◽
pp. 709-756
◽
2013 ◽
Vol 113
(19-21)
◽
pp. 823-826
◽
2008 ◽
Vol 79
(1)
◽
pp. 144-166
◽
Keyword(s):
2010 ◽
Vol 38
(1-2)
◽
pp. 100-120
◽
Keyword(s):