Neighborhood union of independent sets and Hamiltonicity of claw-free graphs (Q1775286)

The main result of the paper claims that for every three positive integers \(s,t,w\) such that if \(G\) is a \((s+t+w-1)\)-connected claw-free graph of order \(n\) and \(d(S)+d(T)+d(W)>n-(s+t+w)\) for every three independent vertex sets with \(| S| =s\), \(| T| =t\), \(| W| =w\), also \(S\cup T\cup W\) is independent, then \(G\) is Hamiltonian.