On the complexity of the Maker-Breaker happy vertex game

Mathieu Hilaire, Perig Montfort, Nacim Oijid

Given a c-colored graph G, a vertex of G is happy if it has the same color as all its neighbors. The notion of happy vertices was introduced by Zhang and Li to compute the homophil…