Decompositions of highly connected graphs into paths of any given length (Q324373)
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: Decompositions of highly connected graphs into paths of any given length |
scientific article; zbMATH DE number 6639449
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions of highly connected graphs into paths of any given length |
scientific article; zbMATH DE number 6639449 |
Statements
Decompositions of highly connected graphs into paths of any given length (English)
0 references
14 October 2016
0 references
edge decomposition
0 references
highly connected
0 references
path decomposition
0 references
0.97851056
0 references
0.9548807
0 references
0.94941366
0 references
0.9390818
0 references
0.9362407
0 references
0.9298011
0 references
0.9297068
0 references
0.92275524
0 references
0.91751015
0 references
0 references
