Partitions of digraphs into paths or circuits (Q1084110)

From MaRDI portal
Revision as of 02:08, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Partitions of digraphs into paths or circuits
scientific article

    Statements

    Partitions of digraphs into paths or circuits (English)
    0 references
    1986
    0 references
    The paper considers the problem of partitioning the arcs of a digraph into elementary paths or circuits. It is conjectured that the arcs of a digraph can be partitioned into \(\alpha\) or fewer elementary paths or circuits where \(\alpha\) is the minimum number of a demi-cocycle. It is shown that the arcs of a pseudo-symmetric digraph or an acircuitous digraph can be partitioned into \(\alpha\) or fewer circuits. Furthermore, the arcs of a bipartite digraph can be partitioned into \(\alpha\) paths or circuits of length at most two and this bound is the best possible.
    0 references
    0 references
    arc partition
    0 references
    graph decomposition
    0 references
    paths
    0 references
    circuits
    0 references
    0 references
    0 references

    Identifiers