| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652317 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
We introduce and study a generalisation of Hamiltonian cycles: an ℓ-distant Hamiltonian walk in a graph G of order n is a cyclic ordering of its vertices in which consecutive vertices are at distance ℓ. Conditions for a Cartesian product graph to possess such an ℓ-distant Hamiltonian walk are given and more specific results are presented concerning toroidal grids.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
