2 papers
math.CO2026
On the parameterized complexity of the Maker-Breaker domination game
Guillaume Bagan, Mathieu Hilaire, Nacim Oijid +1
Since its introduction as a Maker-Breaker positional game by Duchêne et al. in 2020, the Maker-Breaker domination game has become one of the most studied positional games on verti…
cs.DM2026
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…