A generalization of a result of Bauer and Schmeichel (Q1313355)

An important necessary condition for the existence of a Hamiltonian cycle in a graph is toughness, meaning that for every separating vertex set \(S\), the graph \(G-S\) has at most \(| S |\) connected components. In this paper the following theorem is proven: If \(G\) is a tough graph with \(n\) vertices and vertex connectivity \(\kappa\), where \(d(u)+d(v)+d(w) \geq n+\kappa-2\) holds for every three pairwise nonadjacent vertices \(u,v,w\), then \(G\) contains a Hamiltonian cycle.