2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices (Q2282467)

In this article, the authors characterise, for \(n\) sufficiently large, all non-Hamiltonian 2-connected claw-free graphs \(G\) of order \(n\) such that \(d(u)+d(v) \geqslant \frac{2n}{5}-1\) for every edge \(uv\) of \(G\). This improves an earlier result of \textit{Z.-H. Chen} [J. Graph Theory 86, 193--212 (2017; Zbl 1370.05124)]. Various corollaries are deduced.