Hamiltonian decomposition of complete regular multipartite digraphs
Publication
, Journal Article
Ng, LL
Published in: Discrete Mathematics
December 1, 1997
We prove that the complete regular multipartite digraph K*r: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. © 1997 Elsevier Science B.V.
Duke Scholars
Published In
Discrete Mathematics
DOI
ISSN
0012-365X
Publication Date
December 1, 1997
Volume
177
Issue
1-3
Start / End Page
279 / 285
Related Subject Headings
- Computation Theory & Mathematics
- 4904 Pure mathematics
- 4901 Applied mathematics
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Ng, L. L. (1997). Hamiltonian decomposition of complete regular multipartite digraphs. Discrete Mathematics, 177(1–3), 279–285. https://doi.org/10.1016/S0012-365X(97)00017-4
Ng, L. L. “Hamiltonian decomposition of complete regular multipartite digraphs.” Discrete Mathematics 177, no. 1–3 (December 1, 1997): 279–85. https://doi.org/10.1016/S0012-365X(97)00017-4.
Ng LL. Hamiltonian decomposition of complete regular multipartite digraphs. Discrete Mathematics. 1997 Dec 1;177(1–3):279–85.
Ng, L. L. “Hamiltonian decomposition of complete regular multipartite digraphs.” Discrete Mathematics, vol. 177, no. 1–3, Dec. 1997, pp. 279–85. Scopus, doi:10.1016/S0012-365X(97)00017-4.
Ng LL. Hamiltonian decomposition of complete regular multipartite digraphs. Discrete Mathematics. 1997 Dec 1;177(1–3):279–285.
Published In
Discrete Mathematics
DOI
ISSN
0012-365X
Publication Date
December 1, 1997
Volume
177
Issue
1-3
Start / End Page
279 / 285
Related Subject Headings
- Computation Theory & Mathematics
- 4904 Pure mathematics
- 4901 Applied mathematics
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
- 0101 Pure Mathematics