9 citations · 11 across the 17 of their papers we have counts for
3 papers · 1 filter
The Maker-Maker domination game in forests
Eric Duchêne, Arthur Dumas, Nacim Oijid +2
We study the Maker-Maker version of the domination game introduced in 2018 by Duchêne et al. Given a graph, two players alternately claim vertices. The first player to claim a domi…
On the Parameterized Complexity of Relaxations of Clique
Ambroise Baril, Antoine Castillon, Nacim Oijid
We investigate the parameterized complexity of several problems formalizing cluster identification in graphs. In other words we ask whether a graph contains a large enough and suff…
Complexity of Maker-Breaker Games on Edge Sets of Graphs
Eric Duchêne, Valentin Gledel, Fionn Mc Inerney +4
We study the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the -game. Maker wins if s…