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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information and computation Ročník 251; s. 91 - 103
Hlavní autoři: Meeks, Kitty, Scott, Alexander
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.12.2016
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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