2 citations · 2 across the 1 of their papers we have counts for
1 paper
Andrey Kostenko, Andrei Nikolaev
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular gr…