What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? (Q3745872)

From MaRDI portal
Revision as of 18:33, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
scientific article

    Statements

    What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? (English)
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cycle decomposition
    0 references
    Eulerian directed graph
    0 references