Heditniemi, Heditniemi, S.M.; Laskar, R.C.; Mulder, … - Faculteit der Economische Wetenschappen, Erasmus … - 2012
Let $G = (V,E)$ be a graph. A partition $\pi = \{V_1, V_2, \ldots, V_k \}$ of the vertices $V$ of $G$ into $k$ {\it color classes} $V_i$, with $1 \leq i \leq k$, is called a {\it quorum coloring} if for every vertex $v \in V$, at least half of the vertices in the closed neighborhood $N[v]$ of...