What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? (Q3745872): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 5 February 2024
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
1986
0 references
cycle decomposition
0 references
Eulerian directed graph
0 references