Covering Multigraphs by Simple Circuits (Q3703929): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:57, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering Multigraphs by Simple Circuits |
scientific article |
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
