Hamiltonian decomposition of lexicographic products of digraphs (Q1127876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1186392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian decomposition of lexicographic products of digraphs |
scientific article; zbMATH DE number 1186392 |
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
0.8126574754714966
0 references
0.7987471222877502
0 references
