We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Degree conditions restricted to induced paths for hamiltonicity of claw-heavy graphs.
- Authors
Li, Bin; Ning, Bo; Zhang, Sheng
- Abstract
Broersma and Veldman proved that every 2-connected claw-free and P -free graph is hamiltonian. Chen et al. extended this result by proving every 2-connected claw-heavy and P -free graph is hamiltonian. On the other hand, Li et al. constructed a class of 2-connected graphs which are claw-heavy and P -o-heavy but not hamiltonian. In this paper, we further give some Ore-type degree conditions restricting to induced copies of P of a 2-connected claw-heavy graph that can guarantee the graph to be hamiltonian. This improves some previous related results.
- Subjects
HAMILTONIAN graph theory; ISOMORPHISM (Mathematics); SUBGRAPHS; GEOMETRIC vertices; DIRAC function
- Publication
Acta Mathematica Sinica, 2017, Vol 33, Issue 2, p301
- ISSN
1439-8516
- Publication type
Article
- DOI
10.1007/s10114-016-5735-5