Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
Carsten Thomassen · Proceedings of the London Mathematical Society · 1982
We describe sufficient conditions for the existence of Hamiltonian paths in oriented graphs and use these to provide a complete description of the tournaments with no two edge-disjoint Hamiltonian paths. We prove that tournaments with small irregularity have many edge-disjoint Hamiltonian cycles in support of Kelly's conjecture.