The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth

Details The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth

2011-10-18

arxiv.org/abs/1110.4077v2

Computer Science

Computational Complexity

24 pages, 2 figures

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-292812