9 citations · 9 across the 3 of their papers we have counts for
3 papers
math.CO2024★ 9 cited
The Maker-Breaker Largest Connected Subgraph Game
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney +2
Given a graph and , we introduce the following game played in . Each round, Alice colours an uncoloured vertex of red, and then Bob colours one blue (i…
math.CO2023
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…
cs.CC2023
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…