Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007)
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: Degree-constrained decompositions of graphs: Bounded treewidth and planarity |
scientific article; zbMATH DE number 5020406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree-constrained decompositions of graphs: Bounded treewidth and planarity |
scientific article; zbMATH DE number 5020406 |
Statements
Degree-constrained decompositions of graphs: Bounded treewidth and planarity (English)
0 references
28 April 2006
0 references
Graph decomposition
0 references
Treewidth
0 references
Planar graph
0 references
Polynomial algorithm
0 references
PTAS
0 references
0 references
0 references
0.7891591787338257
0 references
0.7647051215171814
0 references
0.7596908211708069
0 references
0.7584479451179504
0 references
0.7559871673583984
0 references
