Abstract: This talk concerns the problem of traversing an m by n directed grid embedded on a torus so that each vertex is visited exactly once before returning to the starting position. We also consider generalizations and variations on this theme. We conclude with an application to computer graphics.
Joe Gallian
| Back to the Program |