Hamiltonian Decomposition of Lexicographic Products of Digraphs
Publication
, Journal Article
Ng, LL
Published in: Journal of Combinatorial Theory. Series B
July 1, 1998
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. © 1998 Academic Press.
Duke Scholars
Published In
Journal of Combinatorial Theory. Series B
DOI
ISSN
0095-8956
Publication Date
July 1, 1998
Volume
73
Issue
2
Start / End Page
119 / 129
Related Subject Headings
- Computation Theory & Mathematics
- 4904 Pure mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Ng, L. L. (1998). Hamiltonian Decomposition of Lexicographic Products of Digraphs. Journal of Combinatorial Theory. Series B, 73(2), 119–129. https://doi.org/10.1006/jctb.1998.1816
Ng, L. L. “Hamiltonian Decomposition of Lexicographic Products of Digraphs.” Journal of Combinatorial Theory. Series B 73, no. 2 (July 1, 1998): 119–29. https://doi.org/10.1006/jctb.1998.1816.
Ng LL. Hamiltonian Decomposition of Lexicographic Products of Digraphs. Journal of Combinatorial Theory Series B. 1998 Jul 1;73(2):119–29.
Ng, L. L. “Hamiltonian Decomposition of Lexicographic Products of Digraphs.” Journal of Combinatorial Theory. Series B, vol. 73, no. 2, July 1998, pp. 119–29. Scopus, doi:10.1006/jctb.1998.1816.
Ng LL. Hamiltonian Decomposition of Lexicographic Products of Digraphs. Journal of Combinatorial Theory Series B. 1998 Jul 1;73(2):119–129.
Published In
Journal of Combinatorial Theory. Series B
DOI
ISSN
0095-8956
Publication Date
July 1, 1998
Volume
73
Issue
2
Start / End Page
119 / 129
Related Subject Headings
- Computation Theory & Mathematics
- 4904 Pure mathematics
- 0101 Pure Mathematics