Hamiltonian decomposition of complete regular multipartite digraphs (Q1377885)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Hamiltonian decomposition of complete regular multipartite digraphs
scientific article

    Statements

    Hamiltonian decomposition of complete regular multipartite digraphs (English)
    0 references
    0 references
    28 April 1998
    0 references
    A directed graph is said to be hamiltonian decomposable if its arc set can be partitioned into directed hamiltonian cycles. The author shows that the complete regular multipartite directed graph with \(r\) parts, each having \(s\) vertices, is hamiltonian decomposable if and only if (\(r, s\)) \(\neq (4,1)\) or \((6,1)\). In so doing, the author completely answers a question posed by Alspach, Bermond, and Sotteau.
    0 references
    hamiltonian cycle
    0 references
    graph decomposition
    0 references

    Identifiers