Quorum colorings of maximum cardinality in linear time for a subclass of perfect trees

Rafik Sahbi, Wissam Boumalha, Asmaa Issad

A partition $\pi =\{V_1,V_2,...,V_k\}$ of the vertex set $V$ of a graph $G$ into $k$ color classes $V_i$, with $1\le i\le k$ is called a quorum coloring of $G$ if for every…