A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
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 graph has many applications in combinatorial optimization and operations research. Our motivation for this problem comes from the field of polyhedral combinatorics, as a sufficient condition for vertex nonadjacency in the 1-skeleton of the traveling salesperson polytope can be formulated as the Hamiltonian decompositionarXiv:2102.12242v2 fatcat:5dx2lga2jvg2rkdsr24izwjwhe