Hamiltonian Paths in Cartesian Powers of Directed Cycles

Simple item page
dc.creatorAustin, David
dc.creatorGavlas, Heather
dc.creatorWitte, Dave
dc.date2001-10-05
dc.date.accessioned2026-07-07T04:43:41Z
dc.date.available2026-07-07T04:43:41Z
dc.descriptionThe vertex set of the kth cartesian power of a directed cycle of length m can be naturally identified with the set of k-tuples of integers modulo m. For any two vertices v and w of this graph, it is easy to see that if there is a hamiltonian path from v to w, then the sum of the coordinates of v is congruent, modulo m, to one more than the sum of the coordinates of w. We prove the converse, unless k = 2 and m is odd.
dc.description8 pages, no figures
dc.identifierhttps://arxiv.org/abs/math/0110073
dc.identifierhttp://arxiv.org/abs/math/0110073
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62336
dc.subjectCombinatorics
dc.subject05C45; 05C25
dc.titleHamiltonian Paths in Cartesian Powers of Directed Cycles
dc.typetext

Files

Collections

arXiv