Algorithms for multicolorings of partial k-trees

Let each vertex v of a graph G have a positive integer weight w(v). Then a multicoloring of G is to assign each vertex v a set of w(v) colors so that any pair of adjacent vertices receive disjoint sets of colors. A partial k-tree is a graph with tree-width bounded by a fixed constant k. This paper presents an algorithm which finds a multicoloring of any given partial k-tree G with the minimum number of colors. The computation time of the algorithm is bounded by a polynomial in the number of vertices and the maximum weight of vertices in G.