Rafik Sahbi

Sub-quorum colorings of graphs

A sub-quorum coloring is a partial vertex coloring in which every colored vertex sees at least half of its colored closed neighborhood in its own color. Hedetniemi, Hedetniemi, Laskar and Mulder introduced its maximum number of colors, $\psq(G)$, as an open direction in their foundational work on quorum colorings. We e...