Hamiltonian Circuits and Paths on the n-Cube
Canadian mathematical bulletin, Tome 9 (1966) no. 5, pp. 557-562
Voir la notice de l'article provenant de la source Cambridge University Press
For positive integral n let Cn denote the n-dimensional unit cube with vertices (δ1, δ2,..., δn) where δi = 0 or 1 for i=1, 2,..., n. Call two vertices of Cn adjacent if the distance between them is 1.
Abbott, H. L. Hamiltonian Circuits and Paths on the n-Cube. Canadian mathematical bulletin, Tome 9 (1966) no. 5, pp. 557-562. doi: 10.4153/CMB-1966-068-6
@article{10_4153_CMB_1966_068_6,
author = {Abbott, H. L.},
title = {Hamiltonian {Circuits} and {Paths} on the {n-Cube}},
journal = {Canadian mathematical bulletin},
pages = {557--562},
year = {1966},
volume = {9},
number = {5},
doi = {10.4153/CMB-1966-068-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-068-6/}
}
[1] 1. Gilbert, E.N., Gray codes and paths on the n-cube. Bell Syst. Tech. J. 37, (1958), pages 815-826. Google Scholar
[2] 2. See also Mills, W. H., Some complete cycles on the n-cube. Proc. Amer. Math. Soc. 14,(1963), pages 640-643. Google Scholar
Cité par Sources :