Abstract
Given a graph G with nonnegative node labels w, a multiset of stable setsS1,…,Sk⊆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.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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
