Golovach, P.A. and Paulusma, D. (2014) 'List coloring in the absence of two subgraphs.', Discrete applied mathematics., 166 . pp. 123-130.
Abstract
A list assignment of a graph G=(V,E) is a function L that assigns a list L(u) of so-called admissible colors to each u∈V. The List Coloring problem is that of testing whether a given graph G=(V,E) has a coloring c that respects a given list assignment L, i.e., whether G has a mapping c:V→{1,2,…} such that (i) c(u)≠c(v) whenever uv∈E and (ii) c(u)∈L(u) for all u∈V. If a graph G has no induced subgraph isomorphic to some graph of a pair {H1,H2}, then G is called (H1,H2)-free. We completely characterize the complexity of List Coloring for (H1,H2)-free graphs.
| Item Type: | Article |
|---|---|
| Keywords: | List coloring, Forbidden induced subgraph, Computational complexity |
| Full text: | (AM) Accepted Manuscript Download PDF (349Kb) |
| Status: | Peer-reviewed |
| Publisher Web site: | http://dx.doi.org/10.1016/j.dam.2013.10.010 |
| Publisher statement: | NOTICE: this is the author’s version of a work that was accepted for publication in Discrete applied mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete applied mathematics, 166, 2014, 10.1016/j.dam.2013.10.010 |
| Date accepted: | No date available |
| Date deposited: | 06 January 2015 |
| Date of first online publication: | March 2014 |
| Date first made open access: | No date available |
Save or Share this output
| Export: | |
| Look up in GoogleScholar |
