Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033951727 / rank | |||
Normal rank | |||
Revision as of 18:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree-constrained decompositions of graphs: Bounded treewidth and planarity |
scientific article |
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
