Hamiltonian paths on directed grids
Combinatorics
2015-12-03 v1
Abstract
Our studies are related to a special class of FASS-curves, which can be described in a node-rewriting Lindenmayer-system. These ortho-tile (or diagonal) type recursive curves inducing Hamiltonian paths. We define a special directed graph on a rectangular grid, and we enumerate all Hamiltonian paths on this graph. Our formulas are strongly related to both the Fibonacci numbers and the domino tilings of chessboards. The constructability of the regular -gon with straightedge and compass is also related.
Keywords
Cite
@article{arxiv.1512.00718,
title = {Hamiltonian paths on directed grids},
author = {Mihály Hujter and András Kaszanyitzky},
journal= {arXiv preprint arXiv:1512.00718},
year = {2015}
}
Comments
12 pages, 5 figures