On the number of Hamiltonian circuits in the $n$-cube

Improved upper and lower bounds are found for the number of hamiltonian circuits in the n-cube.

[1]  L. J. Heider.  A NOTE ON A THEOREM OF , 1957 .

[2]  E. Gilbert.  Gray codes and paths on the N-cube , 1958 .

[3]  H. L. Abbott,et al.  Hamiltonian Circuits and Paths on the n-Cube , 1966, Canadian Mathematical Bulletin.

[4]  P. Griffith,et al.  A note on a theorem of Hill. , 1969 .

[5]  N. S. Barnett,et al.  Private communication , 1969 .

[6]  A Note on a Theorem of H. L. Abbott , 1970, Canadian Mathematical Bulletin.

[7]  S. Goodman,et al.  An all cycle algorithm for undirected graphs , 1973, ACM Annual Conference.