What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? (Q3745872)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? |
scientific article; zbMATH DE number 3981216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? |
scientific article; zbMATH DE number 3981216 |
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
0.8012365102767944
0 references
0.7869009971618652
0 references
