The parameterised complexity of list problems on graphs of bounded treewidth
We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge Chromatic Number and List Total Chromatic Number are fixed parameter tractable, parameterised by treewidth, whereas List Hamilton Path is W[1]-har...
Main Authors: | , |
---|---|
Format: | Journal article |
Published: |
Elsevier
2016
|