Hamiltonian decomposition of complete regular multipartite digraphs (Q1377885)

A directed graph is said to be hamiltonian decomposable if its arc set can be partitioned into directed hamiltonian cycles. The author shows that the complete regular multipartite directed graph with \(r\) parts, each having \(s\) vertices, is hamiltonian decomposable if and only if (\(r, s\)) \(\neq (4,1)\) or \((6,1)\). In so doing, the author completely answers a question posed by Alspach, Bermond, and Sotteau.