Enumerating the Walecki-Type Hamiltonian Cycle Systems
Emanuele Brugnoli · Journal of Combinatorial Designs · 2017
Let be the complete graph on v vertices. A Hamiltonian cycle system of odd order v (briefly ) is a set of Hamiltonian cycles of whose edges partition the edge set of . By means of a slight modification of the famous of Walecki, we obtain 2n pairwise distinct and we enumerate them up to isomorphism proving that this is equivalent to count the number of binary bracelets of length n, i.e. the orbits of , the dihedral group of order 2n, acting on binary n-tuples.