Decompositions of highly connected graphs into paths of length five (Q324786)
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 length five |
scientific article; zbMATH DE number 6639895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decompositions of highly connected graphs into paths of length five |
scientific article; zbMATH DE number 6639895 |
Statements
Decompositions of highly connected graphs into paths of length five (English)
0 references
17 October 2016
0 references
edge decomposition
0 references
highly connected
0 references
path decomposition
0 references
0.9864200353622437
0 references
0.9844643473625184
0 references
0.9438436627388
0 references
0.8978750705718994
0 references
0.8855360150337219
0 references
