Long cycles in graphs through fragments

Zh. G. Nikoghosyan

Four basic Dirac-type sufficient conditions for a graph $G$ to be hamiltonian are known involving order $n$, minimum degree $\delta$, connectivity $\kappa$ and independence number $\alpha$ of $G$…