Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs

Abstract: Broersma and Veldman proved that every 2-connected claw-free and

P_{6}

-free graph is hamiltonian. Chen et al. extended this result by proving every 2-connected claw-heavy and

P_{6}

-free graph is hamiltonian. On the other hand, Li et al. constructed a class of 2-connected graphs which are claw-heavy and

P_{6}

-emph{o}-heavy but not hamiltonian. In this paper we further give some Ore-type degree conditions restricting to induced

P_{6}

's of a 2-connected claw-heavy graph that can guarantee the graph to be hamiltonian. This improves some previous related results.

Recommendations

Cites Work

Cited In (10)

This page was built for publication: Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs