Traceability in Claw-Free Graphs Through Induced Bulls

Abstract

It is shown that if a graph $G$ is connected, claw-free, and such that the vertices of degree 1 of every induced bull have a common neighbor in $G$, then $G$ is traceable.