On traceability of claw-o_{-1}-heavy graphs

Binlong Li, Shenggui Zhang

A graph is called traceable if it contains a Hamilton path, i.e., a path passing through all its vertices. Let $G$ be a graph on $n$ vertices. $G$ is called claw-$o_{-1}$-heavy if…