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 clawheavy 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 -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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.