@inproceedings{b8f602ab08d640c5b6cbf63ff97572b0,

title = "Algorithms for the multicolorings of partial k-trees",

abstract = "Let each vertex v of a graph G have a positive integer weight ω(v). Then a multicoloring of G is to assign each vertex v a set of ω(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.",

author = "Takehiro Ito and Takao Nishizeki and Gyo Shu",

year = "2002",

month = jan,

day = "1",

language = "English",

isbn = "354043996X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "430--439",

editor = "Ibarra, {Oscar H.} and Louxin Zhang",

booktitle = "Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings",

note = "8th Annual International Conference on Computing and Combinatorics, COCOON 2002 ; Conference date: 15-08-2002 Through 17-08-2002",

}