1 paper
Rafik Sahbi, Youcef Belkina, Amar Bennadji
A partition π={V1,V2,...,Vk} of the vertex set V of a graph G into k color classes Vi, with i∈{1,...,k} is called a {\it quorum coloring} if for every…