Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Narrowing the complexity gap for colouring (C_s,P_t)-free graphs.

Huang, S. and Johnson, M. and Paulusma, D. (2014) 'Narrowing the complexity gap for colouring (C_s,P_t)-free graphs.', in 10th International Conference, AAIM 2014, Vancouver, BC, Canada, 8-11 July 2014 ; proceedings. Berlin, Heidelberg: Springer, pp. 162-173. Lecture notes in computer science. (8546).

Abstract

Let k be a positive integer. The k-Colouring problem is to decide whether a graph has a k-colouring. The k-Precolouring Extension problem is to decide whether a colouring of a subset of a graph’s vertex set can be extended to a k-colouring of the whole graph. A k-list assignment of a graph is an allocation of a list — a subset of {1,…,k} — to each vertex, and the List k -Colouring problem asks whether the graph has a k-colouring in which each vertex is coloured with a colour from its list. We prove a number of new complexity results for these three decision problems when restricted to graphs that do not contain a cycle on s vertices or a path on t vertices as induced subgraphs (for fixed positive integers s and t).

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
(321Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1007/978-3-319-07956-1_15
Publisher statement:The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-07956-1_15
Date accepted:No date available
Date deposited:15 January 2015
Date of first online publication:2014
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar