Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (Q2675828)

A \(t\)-tough graph is a noncomplete graph \(G\) such that \(|S| \geq t \cdot c(G-S)\) for every cutset \(S\) of \(G\). This concept is strongly related to the Hamiltonicity of graphs. In the paper under review, the authors prove that every \(7\)-tough \((P_3 \cup 2P_1)\)-free graph with at least three vertices is Hamiltonian.