We affirm several special cases of a conjecture that first appears in Alspach et al. (1987) which stipulates that the wreath (lexicographic) product of two hamiltonian decomposable di- rected graphs is also hamiltonian decomposable. Specifically, we show that the wreath product of hamiltonian decomposable directed graph G, such that |V (G)| is even and |V (G)| ? 3, with a directed m-cycle such that m ? 4 or the complete symmetric directed graph on m vertices such that m ? 3, is hamiltonian decomposable. We also show the wreath product of a directed n-cycle, where n is even, with a directed m-cycle, where m ? {2, 3}, is not hamiltonian decomposable.

Rights

URN

URN:NBN:SI:doc-H78TRFKY

COBISSID

289257731

DOI

10.26493/1855-3974.3471.51f

Added

27.10.2026

Metadata

Citation

APA:

Lacaze-Masmonteil, Alice (2026). Decompositions of the wreath product of certain directed graphs into directed hamiltonian cycles. Ars mathematica contemporanea, volume 26, issue 2, article p2.04, str. 1-26. URN:NBN:SI:doc-H78TRFKY from http://www.dlib.si

MLA:

Lacaze-Masmonteil, Alice. "Decompositions of the wreath product of certain directed graphs into directed hamiltonian cycles." Ars mathematica contemporanea volume 26. issue 2. article p2.04 (2026) str. 1-26.
<http://www.dlib.si/?URN=URN:NBN:SI:doc-H78TRFKY>