1. Tough graphs and Hamiltonian circuits;Chvátal;Discrete Math.,1973
2. The computational complexity of deciding Hamiltonian-connectedness;Dean;Congr. Numer.,1996
3. Computers and Intractability, A Guide to the Theory of NP-Completeness;Garey,1979
4. The planar Hamiltonian circuit problem is NP-complete;Garey;SIAM J. Comput.,1976
5. Polytopes, graphs, and complexes;Grünbaum;Bull. Amer. Math. Soc.,1970