Skip to main content
Log in

Multicolorings of Series-Parallel Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Let G be a graph, and let each vertex v of G have a positive integer weight ω(v). 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. This paper presents an algorithm to find a multicoloring of a given series-parallel graph G with the minimum number of colors in time O(n W), where n is the number of vertices and W is the maximum weight of vertices in G.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Xiao Zhou or Takao Nishizeki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, X., Nishizeki, T. Multicolorings of Series-Parallel Graphs. Algorithmica 38, 271–297 (2004). https://doi.org/10.1007/s00453-003-1060-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-003-1060-3

Navigation