Decomposing highly connected graphs into paths of length five (Q1752489)
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 connected graphs into paths of length five |
scientific article; zbMATH DE number 6872415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing highly connected graphs into paths of length five |
scientific article; zbMATH DE number 6872415 |
Statements
Decomposing highly connected graphs into paths of length five (English)
0 references
24 May 2018
0 references
tree decomposition conjecture
0 references
decomposition of highly connected graphs
0 references
decomposition of graphs into paths
0 references
decomposition conjecture of Barát and Thomassen
0 references
0.9864200353622437
0 references
0.9676563739776612
0 references
0.9466310739517212
0 references
0.8958255648612976
0 references
0.8709513545036316
0 references
