On the majority game chromatic number of forests and other graphs

Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan

A majority coloring (also called an unfriendly partition) of a graph $G$ is a vertex coloring of $G$ in which no vertex has more than half of its neighbors colored with its own col…