Structural and computational aspects of majority coloring games

Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan +1

A majority coloring of a graph $G=(V,E)$ is a coloring of $V(G)$ such that, for each vertex $v$, the number of neighbors of $v$ with the same color as $v$ is at most $deg(v)/2$.…