Pairs of heavy subgraphs for Hamiltonicity of 2-connected graphs

Binlong Li, Zdeněk Ryjáček, Ying Wang +1

Let $G$ be a graph on $n$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $…