Polynomial-Time Algorithms for Hamiltonian Path and Cycle in Graphs with Bounded Independence Number

Hamiltonian path and Hamiltonian cycle problems are solvable in polynomial time for graphs with bounded independence number.