On 3-connected graphs of path-width at most three (Q2870519)
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: On 3-connected graphs of path-width at most three |
scientific article; zbMATH DE number 6248052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On 3-connected graphs of path-width at most three |
scientific article; zbMATH DE number 6248052 |
Statements
21 January 2014
0 references
graph minors
0 references
path-width
0 references
tree-width
0 references
On 3-connected graphs of path-width at most three (English)
0 references
0.8668034076690674
0 references
0.8187634944915771
0 references
0.817732036113739
0 references
0.7729768753051758
0 references
0.7656735777854919
0 references
