Generalized vertex-colorings of partial k-trees

Xiao Zhou, Yasuaki Kanari, Takao Nishizeki

Research output: Contribution to journalArticlepeer-review

37 Citations (Scopus)


Let l be a positive integer, and let G be a graph with nonnegative integer weights on edges. Then a generalized vertex-coloring, called an l-coloring of G, is an assignment of colors to the vertices of G in such a way that any two vertices u and ν get different colors if the distance between u and ν in G is at most l. In this paper we give an algorithm to find an l-coloring of a given graph G with the minimum number of colors. The algorithm takes polynomial time if G is a partial k-tree and both l and k are bounded integers.

Original languageEnglish
Pages (from-to)671-677
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number4
Publication statusPublished - 2000


  • Algorithm
  • Generalized vertex-coloring
  • l-coloring
  • Partial k-tree


Dive into the research topics of 'Generalized vertex-colorings of partial k-trees'. Together they form a unique fingerprint.

Cite this