Heavy subgraph conditions for longest cycles to be heavy in graphs

Binlong Li, Shenggui Zhang

Let $G$ be a graph on $n$ vertices. A vertex of $G$ with degree at least $n/2$ is called a heavy vertex, and a cycle of $G$ which contains all the heavy vertices of $G$ is called a…