On the complexity of some colorful problems parameterized by treewidth (Q627124)
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 the complexity of some colorful problems parameterized by treewidth |
scientific article; zbMATH DE number 5853775
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of some colorful problems parameterized by treewidth |
scientific article; zbMATH DE number 5853775 |
Statements
On the complexity of some colorful problems parameterized by treewidth (English)
0 references
21 February 2011
0 references
parameterized complexity
0 references
bounded treewidth
0 references
graph coloring
0 references
1.0000001
0 references
0.94691503
0 references
0.9462024
0 references
0.9311249
0 references
0.93037224
0 references
0.9115218
0 references
0.9115218
0 references
0.90394056
0 references
