What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? (Q3745872): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190100307 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982405111 / rank | |||
Normal rank | |||
Revision as of 01:43, 20 March 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
