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:

Open problems on graph coloring for special graph classes.

Paulusma, D. (2016) 'Open problems on graph coloring for special graph classes.', in Graph-theoretic concepts in computer science : 41st international workshop, WG 2015, Garching, Germany, June 17-19, 2015 ; revised papers. Berlin: Springer, pp. 16-30. Lecture notes in computer science. (9224).


For a given graph G and integer k, the Coloring problem is that of testing whether G has a k-coloring, that is, whether there exists a vertex mapping c:V→{1,2,…}c:V→{1,2,…} such that c(u)≠c(v)c(u)≠c(v) for every edge uv∈Euv∈E. We survey known results on the computational complexity of Coloring for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of on-line coloring.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
Status:Not peer-reviewed
Publisher Web site:
Publisher statement:The final publication is available at Springer via
Date accepted:12 August 2015
Date deposited:21 August 2015
Date of first online publication:05 August 2016
Date first made open access:05 August 2017

Save or Share this output

Look up in GoogleScholar