### Abstract

We investigate a restricted list-coloring problem. Given a graph G = (V,E), a non empty set of colors L, and a nonempty subset L(v) of L for each vertex v, find an L-coloring of G with the size of each class of colors being equal to a given integer. This restricted list-coloring problem was proposed by de Werra. We prove that this problem is script N sign P-Complete even if the graph is a path with at most two colors on each vertex list. We then give a polynomial algorithm which solves this problem for the case where the total number of colors occurring in all lists is fixed.

Original language | English (US) |
---|---|

Pages (from-to) | 103-109 |

Number of pages | 7 |

Journal | Discrete Mathematics |

Volume | 195 |

Issue number | 1-3 |

DOIs | |

State | Published - Jan 1 1999 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'On the complexity of a restricted list-coloring problem'. Together they form a unique fingerprint.

## Cite this

Dror, M., Finke, G., Gravier, S., & Kubiak, W. (1999). On the complexity of a restricted list-coloring problem.

*Discrete Mathematics*,*195*(1-3), 103-109. https://doi.org/10.1016/S0012-365X(98)00169-1