Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
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 th...
Main Authors: | Mustapha Kchikech, Olivier Togni |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2006-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/507 |
Similar Items
-
Approximating Triangular Meshes by Triangular Bézier Patches
by: Shih Mengchang, et al.
Published: (2012) -
METRICS FOR IMAGE SURFACE APPROXIMATION BASED ON TRIANGULAR MESHES
by: Eduardo Sant'Ana da Silva, et al.
Published: (2018-04-01) -
Multicolored Parallelisms of Isomorphic Graphs
by: Yuan-Hsun Lo, et al.
Published: (2006) -
Approximation algorithms for graph-theoretic problems :
planar subgraphs and multiway cut
by: Calinescu, Gruia
Published: (2006) -
The Chromatic Number of the Square of a Planar Graph
by: 王博賢
Published: (2014)