Canadian Mathematical Bulletin · 1966 · 17 citations · 2 references
Natural SciencesComputer ScienceMathematicsCircuit TheoryCombinatoricsComputational GeometryGraph TheoryHamiltonian CircuitsHamiltonian GraphsHamiltonian Path AlgorithmsHamiltonian Path ProblemHamiltonian Paths
For positive integral n let C n 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 C n adjacent if the distance between them is 1.
2
Gray Codes and Paths on the n-Cube
E. N. Gilbert · Bell System Technical Journal · 1958 · 249 citations