Maximum run length in a toroidal grid graph

Simple item page
dc.creatorDoig, Margaret I.
dc.date2004-12-29
dc.date.accessioned2026-07-07T05:15:41Z
dc.date.available2026-07-07T05:15:41Z
dc.descriptionA toroidal grid graph is a Cartesian product of cycles, and the run length of a Hamiltonian cycle in a grid graph is defined to be the maximum number r such that any r consecutive edges include no more than one edge in any dimension. By constructive methods, we place bounds on the maximum run length possible for a Hamiltonian cycle in several families of grid graphs.
dc.description8 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0412530
dc.identifierhttp://arxiv.org/abs/math/0412530
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73717
dc.subjectCombinatorics
dc.subject05C38
dc.titleMaximum run length in a toroidal grid graph
dc.typetext

Files

Collections

arXiv