Degree conditions restricted to induced paths for hamiltonicity of claw-heavy graphs
Combinatorics
2017-01-11 v1
Abstract
Broersma and Veldman proved that every 2-connected claw-free and -free graph is hamiltonian. Chen et al. extended this result by proving every 2-connected claw-heavy and -free graph is hamiltonian. On the other hand, Li et al. constructed a class of 2-connected graphs which are claw-heavy and -\emph{o}-heavy but not hamiltonian. In this paper we further give some Ore-type degree conditions restricting to induced 's of a 2-connected claw-heavy graph that can guarantee the graph to be hamiltonian. This improves some previous related results.
Keywords
Cite
@article{arxiv.1506.05540,
title = {Degree conditions restricted to induced paths for hamiltonicity of claw-heavy graphs},
author = {Binlong Li and Bo Ning and Shenggui Zhang},
journal= {arXiv preprint arXiv:1506.05540},
year = {2017}
}
Comments
12 pages, 3 figures