Maximum run length in a toroidal grid graph

Details Maximum run length in a toroidal grid graph Maximum run length in a toroidal grid graph

2004-12-29

arxiv.org/abs/math/0412530v1

Mathematics

Combinatorics

8 pages, 2 figures

Scientific paper

A 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.

Affiliated with

Also associated with

No associations

Rating

Maximum run length in a toroidal grid graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum run length in a toroidal grid graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum run length in a toroidal grid graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319819