Abstract
The vertex set of the k th cartesian power of a directed cycle of length m can be naturally identified with the abelian group (ℤ m )k. For any two elements u=(u 1,…,u k ) and v=(v 1,…,v k ) of (ℤ m )k, it is easy to see that if there is a hamiltonian path from u to v, then
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Austin, D., Gavlas, H. & Witte, D. Hamiltonian Paths in Cartesian Powers of Directed Cycles. Graphs and Combinatorics 19, 459–466 (2003). https://doi.org/10.1007/s00373-002-0519-3
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-002-0519-3