1. Inclusion and exclusion algorithm for the Hamiltonian path problem;Bax;Inform. Process. Lett.,1993
2. 3-Coloring in time O(1.3446n): a no-MIS algorithm;Beigel,1995
3. D. Eppstein, Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction, in: Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 329–337
4. Expected computation time for the Hamiltonian path problem;Gurevich;SIAM J. Comput.,1987
5. A dynamic programming approach to sequencing problems;Held;J. Soc. Indust. Appl. Math.,1962