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...

Full description

Saved in:
Bibliographic Details
Published in:Information and computation Vol. 251; pp. 91 - 103
Main Authors: Meeks, Kitty, Scott, Alexander
Format: Journal Article
Language:English
Published: Elsevier Inc 01.12.2016
Subjects:
Bounded treewidth
Graph colouring
Hamilton path
List colouring
Parameterised complexity
List colouring
Bounded treewidth
Graph colouring
Hamilton path
Parameterised complexity
ISSN:0890-5401, 1090-2651
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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]-hard, even parameterised by pathwidth. These results resolve two open questions of Fellows, Fomin, Lokshtanov, Rosamond, Saurabh, Szeider and Thomassen (2011).
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2016.08.001