Meeks, K. and Scott, A. (2016) The parameterised complexity of list problems on graphs of bounded treewidth. Information and Computation, 251, pp. 91-103. (doi: 10.1016/j.ic.2016.08.001)
|
Text
122505.pdf - Accepted Version 584kB |
Abstract
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).
Item Type: | Articles |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Meeks, Dr Kitty |
Authors: | Meeks, K., and Scott, A. |
College/School: | College of Science and Engineering > School of Mathematics and Statistics > Mathematics |
Journal Name: | Information and Computation |
Publisher: | Elsevier |
ISSN: | 0890-5401 |
ISSN (Online): | 1090-2651 |
Published Online: | 16 August 2016 |
Copyright Holders: | Copyright © 2016 Elsevier |
First Published: | First published in Information and Computation 251:91-103 |
Publisher Policy: | Reproduced in accordance with the copyright policy of the publisher |
University Staff: Request a correction | Enlighten Editors: Update this record