Decomposing series-parallel graphs into paths of length 3 and triangles (Q322267)
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 series-parallel graphs into paths of length 3 and triangles |
scientific article; zbMATH DE number 6639393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing series-parallel graphs into paths of length 3 and triangles |
scientific article; zbMATH DE number 6639393 |
Statements
Decomposing series-parallel graphs into paths of length 3 and triangles (English)
0 references
14 October 2016
0 references
3-path decomposition
0 references
edge-decomposition
0 references
planar graph
0 references
2-edge-connected
0 references
series-parallel graph
0 references
0.8266164660453796
0 references
0.806732714176178
0 references
0.7998606562614441
0 references
0.7949843406677246
0 references
0.7940356135368347
0 references
