Hamiltonian decomposition of lexicographic products of digraphs (Q1127876): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jctb.1998.1816 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCTB.1998.1816 / rank | |||
Normal rank | |||
Latest revision as of 15:37, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian decomposition of lexicographic products of digraphs |
scientific article |
Statements
Hamiltonian decomposition of lexicographic products of digraphs (English)
0 references
10 September 1998
0 references
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.
0 references
hamiltonian decomposition
0 references
lexicographic product
0 references
