HAMILTONIAN DECOMPOSITION OF LEXICOGRAPHIC PRODUCTS OF DIGRAPHS

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. (C) 1998 Academic Press.