pith. machine review for the scientific record. sign in

arxiv: 1506.05540 · v1 · submitted 2015-06-18 · 🧮 math.CO

Recognition: unknown

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

Authors on Pith no claims yet
classification 🧮 math.CO
keywords claw-heavyconnectedgraphhamiltonianconditionsdegreeeveryfree
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.