Skip to main content
Log in

Hamiltonian Paths in Cartesian Powers of Directed Cycles

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Heather Gavlas.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0519-3

Keywords

Navigation