On the number of Hamiltonian circuits in the $n$-cube
HTML articles powered by AMS MathViewer
- by E. Dixon and S. Goodman PDF
- Proc. Amer. Math. Soc. 50 (1975), 500-504 Request permission
Abstract:
Improved upper and lower bounds are found for the number of hamiltonian circuits in the $n$-cube.References
- Branko Grünbaum, Convex polytopes, Pure and Applied Mathematics, Vol. 16, Interscience Publishers John Wiley & Sons, Inc., New York, 1967. With the cooperation of Victor Klee, M. A. Perles and G. C. Shephard. MR 0226496
- E. N. Gilbert, Gray codes and paths on the $n$-cube, Bell System Tech. J. 37 (1958), 815–826. MR 94273, DOI 10.1002/j.1538-7305.1958.tb03887.x
- Robert J. Douglas, A note on a theorem of H. L. Abbott, Canad. Math. Bull. 13 (1970), 79–81. MR 280397, DOI 10.4153/CMB-1970-016-1
- H. L. Abbott, Hamiltonian circuits and paths on the $n$-cube, Canad. Math. Bull. 9 (1966), 557–562. MR 207580, DOI 10.4153/CMB-1966-068-6 E. Dixon and S. Goodman, An algorithm for finding all the hamiltonian circuits and two factors in an arbitrary directed or undirected graph, DAMACS Tech. Rept., 3-73, University of Virginia, Charlottsville, Va., 1973. E. N. Gilbert, Private communication.
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 50 (1975), 500-504
- MSC: Primary 05C35
- DOI: https://doi.org/10.1090/S0002-9939-1975-0369157-0
- MathSciNet review: 0369157