Hamiltonian decomposition of lexicographic products of digraphs (Q1127876): Difference between revisions

We partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexicographic product of two hamiltonian decomposable digraphs, the first of odd order, is itself hamiltonian decomposable in general.