Covering Multigraphs by Simple Circuits (Q3703929)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3929054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering Multigraphs by Simple Circuits |
scientific article; zbMATH DE number 3929054 |
Statements
Covering Multigraphs by Simple Circuits (English)
0 references
1985
0 references
Eulerian subgraphs
0 references
graph algorithms
0 references
nowhere-zero flow
0 references
minimum cover
0 references
bridgeless multigraph
0 references
0.8546207547187805
0 references
0.8528639674186707
0 references
0.8505448698997498
0 references
0.8342540264129639
0 references
0.834215521812439
0 references
