1. Angluin, D., Valiant, L.G.: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. System. Sci. 18(2), 155–193 (1979)
2. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem. A Computational Study. Princeton University Press, Princeton (2006)
3. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, ch. 5. Springer, London (2008),
http://www.cs.rhul.ac.uk/books/dbook/
4. Bollobás, B., Fenner, T.I., Frieze, A.M.: An Algorithm for Finding Hamiltonian Paths and Cycles in Random Graphs. Combinatorica 7(4), 327–341 (1987)
5. Christofides, N.: Graph Theory – An Algorithmic Approach. Academic Press, New York (1975)