The parameterised complexity of list problems on graphs of bounded treewidth (Q342709)
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: The parameterised complexity of list problems on graphs of bounded treewidth |
scientific article; zbMATH DE number 6654481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterised complexity of list problems on graphs of bounded treewidth |
scientific article; zbMATH DE number 6654481 |
Statements
The parameterised complexity of list problems on graphs of bounded treewidth (English)
0 references
18 November 2016
0 references
parameterised complexity
0 references
bounded treewidth
0 references
graph colouring
0 references
list colouring
0 references
Hamilton path
0 references
0 references
0.9003293
0 references
0.9003293
0 references
0.8965769
0 references
0.88778365
0 references
0.88778365
0 references
0.8833289
0 references
