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