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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information and computation Jg. 251; S. 91 - 103
Hauptverfasser: Meeks, Kitty, Scott, Alexander
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.12.2016
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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