Decomposing highly edge-connected graphs into paths of any given length (Q345101)
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: Decomposing highly edge-connected graphs into paths of any given length |
scientific article; zbMATH DE number 6656179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing highly edge-connected graphs into paths of any given length |
scientific article; zbMATH DE number 6656179 |
Statements
Decomposing highly edge-connected graphs into paths of any given length (English)
0 references
25 November 2016
0 references
path
0 references
decomposition
0 references
connectivity
0 references
0.9684144854545592
0 references
0.9466310739517212
0 references
0.9438436627388
0 references
0.9351715445518494
0 references
0.9065479040145874
0 references
