Coloring fuzzy circular interval graphs

Given a graph G with nonnegative node labels w, a multiset of stable sets S_1,...,S_k\subseteq V(G) such that each vertex v \in V(G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number \chi_w(G) is the smallest k such that there exist stable sets as above. We provide a polynomial time combinatorial algorithm that computes the weighted coloring number and the corresponding colorings for fuzzy circular interval graphs. The algorithm reduces the problem to the case of circular interval graphs, then making use of a coloring algorithm by Gijswijt. We also show that the stable set polytopes of fuzzy circular interval graphs have the integer decomposition property.


Published in:
European Journal of Combinatorics, 33, 5, 893-904
Year:
2012
Publisher:
Elsevier
ISSN:
0195-6698
Keywords:
Laboratories:




 Record created 2011-10-24, last modified 2018-09-13

Preprint:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)