The problem of decomposing a graph or digraph into hamiltonian cycles is of significant interest, as evidenced by the survey on hamiltonian decomposition by Alspach, Bermond, and Sotteau [1]. In [4], the author shows that all complete regular multipartite digraphs are decomposable into directed hamiltonian cycles, thus resolving a conjecture in [1]. In this paper, we address a related and somewhat more general conjecture of Alspach, Bermond, and Sotteau.