The Hamilton compression of highly symmetric graphs

Petr Gregor, Arturo Merino, Torsten Mütze

We say that a Hamilton cycle $C=(x_1,\dots ,x_n)$ in a graph $G$ is $k$-symmetric, if the mapping $x_i\mapsto x_{i+n/k}$ for all $i=1,\dots ,n$, where indices are considered modulo…