Algorithms for the multicolorings of partial k-trees

Takehiro Ito, Takao Nishizeki, Xiao Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


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.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings
EditorsOscar H. Ibarra, Louxin Zhang
PublisherSpringer Verlag
Number of pages10
ISBN (Print)354043996X, 9783540439967
Publication statusPublished - 2002
Event8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore
Duration: 2002 Aug 152002 Aug 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other8th Annual International Conference on Computing and Combinatorics, COCOON 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Algorithms for the multicolorings of partial k-trees'. Together they form a unique fingerprint.

Cite this