The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem | IEEE Conference Publication | IEEE Xplore