Preprint
Aug 2026
Majority C-coloring in Cartesian products
A majority C-coloring of a graph $G$ assigns colors to the vertices such that every vertex shares its color with at least half of its neighbors. The maximum number of colors that can be used in such a coloring of $G$ is denoted by $\overline{\chi}_{\geqslant}(G)$. In this paper, the focus is on the majority C-coloring...
Csilla Bujtás, M. Dettlaff, Hanna Furmanczyk et al.
· 0 citations