1. An algorithm for finding all the Hamiltonian circuits and two factors in an arbitrary directed or undirected graph, DAMACS Technical Report, 3-73;Dixon,1973
2. On the number of Hamiltonian circuits in the n-cube;Dixon;Proc. Am. Math. Soc,1975
3. Bounds on the number of Hamiltonian circuits in the n-cube;Douglas;Discrete Math,1977
4. Hamiltonian circuits and paths on the n-cube;Abbott;Canad. Math. Bull,1966
5. The curious properties of the Gray code;Gardner;Scientific American,1972