4 papers
Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth
Gaétan Berthe, Florent Foucaud, Tuomo Lehtilä +1
The neighbourhood complexity of a graph is a quantity measuring, for a graph and an integer , the maximum possible number (over all vertex subsets of size…
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…
Creating triangles in Constructor-Blocker games
Chloé Boisson, Yannick Mogge, Aline Parreau +1
Generalized Turán problems investigate the maximization of the number of certain structures (typically edges) under some constraints in a graph. We study a game version of these p…
The Avoider-Enforcer game on hypergraphs of rank 3
Florian Galliot, Valentin Gledel, Aline Parreau
In the Avoider-Enforcer convention of positional games, two players, Avoider and Enforcer, take turns selecting vertices from a hypergraph H. Enforcer wins if, by the time all vert…