  In this paper we extend counting of traversing Hamiltonian cycles from
2-tiled graphs to generalized tiled graphs. We further show that, for a fixed
finite set of tiles, counting traversing Hamiltonian cycles can be done in
linear time with respect to the size of such graph, implying counting
Hamiltonian cycles in tiled graphs is fixed-parameter tractable.
