Coloring fuzzy circular interval graphs

Given a graph G with nonnegative node labels w , a multiset of stable sets S 1 , … , S k ⊆ V ( G ) such that each vertex v ∈ V ( G ) is contained in w ( v ) many of these stable sets is called a weighted coloring. The weighted coloring number χ w ( G ) is the smallest k such that there exist stable sets as above. vide 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. o show that the stable set polytopes of fuzzy circular interval graphs have the integer decomposition property.