Hamiltonian cycles through prescribed edges in k-ary n-cubes.
(2011)
Presentation / Conference Contribution
Stewart, I. (2011, December). Hamiltonian cycles through prescribed edges in k-ary n-cubes. Presented at 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA'11., Zhangjiajie, China
We prove that if P is a set of at most 2n − 1 edges in a k-ary n-cube, where k ≥ 4 and n ≥ 2, then there is a Hamiltonian cycle on which every edge of P lies if, and only if, the subgraph of the k-ary n-cube induced by the edges of P is a vertex-disj... Read More about Hamiltonian cycles through prescribed edges in k-ary n-cubes..