Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566)
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: Parameterized complexity of coloring problems: treewidth versus vertex cover |
scientific article; zbMATH DE number 5895907
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of coloring problems: treewidth versus vertex cover |
scientific article; zbMATH DE number 5895907 |
Statements
Parameterized complexity of coloring problems: treewidth versus vertex cover (English)
0 references
18 May 2011
0 references
graph colorings
0 references
graph labelings
0 references
parameterized complexity
0 references
vertex cover
0 references
0 references
0.99656081199646
0 references
0.858327329158783
0 references
0.8493146896362305
0 references
0.8170631527900696
0 references
0.8164725303649902
0 references
