A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes

2006
*
Discrete Mathematics & Theoretical Computer Science
*

International audience A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G. In particular, we are interested in a minimum multicoloring that uses the least total number of colors. The main focus of this work is to obtain upper bounds on the weighted chromatic number of some classes of graphs in terms of the weighted clique

doi:10.46298/dmtcs.371
fatcat:w4czre2fgvg5dcp2r6h42okx5m