Two sufficient conditions for the existence of Hamilton cycles in graphs

Bo Ning, Bing Chen, Shenggui Zhang

Let $G$ be a graph on $n\ge 3$ vertices, claw the bipartite graph $K_{1,3}$, and $Z_i$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$…