Title of article
Hamiltonian decomposition of complete regular multipartite digraphs
Author/Authors
Lenhard L Ng، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
7
From page
279
To page
285
Abstract
We prove that the complete regular multipartite digraph Kr;s∗ is decomposable into directed hamiltonian cycles if and only if (r, s) ≠ (4, 1) or (6, 1), thereby answering a question of Alspach, Bermond, and Sotteau.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951700
Link To Document