The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046)
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: The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs |
scientific article; zbMATH DE number 6699286
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs |
scientific article; zbMATH DE number 6699286 |
Statements
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (English)
0 references
31 March 2017
0 references
edge-disjoint paths
0 references
\(4\)-edge-connected graphs
0 references
Eulerian graphs
0 references
0 references
0 references
