Maximum run length in a toroidal grid graph
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0412530,
title = {Maximum run length in a toroidal grid graph},
author = {Margaret I. Doig},
journal= {arXiv preprint arXiv:math/0412530},
year = {2007}
}
备注
8 pages, 2 figures