Title of article
Complexity of list coloring problems with a fixed total number of colors Original Research Article
Author/Authors
Sylvain Gravier and Julien Moncel، نويسنده , , Daniel Kobler، نويسنده , , Wieslaw Kubiak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
15
From page
65
To page
79
Abstract
We study list coloring problems where the total number k of colors on all lists is fixed. Such problems are known to be NP-Complete even for planar bipartite graphs and k=3. We give polynomial algorithms for some special cases of these problems.
Keywords
Complexity , List coloring
Journal title
Discrete Applied Mathematics
Serial Year
2002
Journal title
Discrete Applied Mathematics
Record number
885351
Link To Document