Hamiltonian cycles through prescribed edges in k-ary n-cubes.
(2011)
Presentation / Conference Contribution
Stewart, I. (2011). Hamiltonian cycles through prescribed edges in k-ary n-cubes. In W. Wang, X. Zhu, & D. Du (Eds.), Combinatorial Optimization and Applications. COCOA 2011 (82-97). https://doi.org/10.1007/978-3-642-22616-8_8
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..