Partitions of digraphs into paths or circuits (Q1084110): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Path numbers of tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path decompositions of digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5615282 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound on the path number of a digraph / rank | |||
Normal rank |
Latest revision as of 16:26, 17 June 2024
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
arc partition
0 references
graph decomposition
0 references
paths
0 references
circuits
0 references