Hamiltonian decomposition of lexicographic products of digraphs (Q1127876)

From MaRDI portal
Revision as of 13:38, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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
    0 references
    0 references
    0 references
    0 references
    hamiltonian decomposition
    0 references
    lexicographic product
    0 references
    0 references