7 papers · 1 filter
On the damage number of graphs
Valentin Gledel, William B. Kinnersley, Balázs Patkós +1
We study a variant of Cops and Robbers in which the robber attempts to visit as many vertices of the graph as possible without being captured, while the cop aims to keep the robber…
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…
On the complexity of Client-Waiter and Waiter-Client games
Valentin Gledel, Nacim Oijid, Sébastien Tavenas +1
Positional games were introduced by Hales and Jewett in 1963, and their study became more popular after Erdos and Selfridge's first result on their connection to Ramsey theory and…
On the Metric Dimension of
Valentin Gledel, Gerold Jäger
In this work we determine the metric dimension of for all with as follows. For and , this val…
Partition strategies for the Maker-Breaker domination game
Guillaume Bagan, Eric Duchêne, Valentin Gledel +2
The Maker-Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has…
Simple Chopsticks: Playing with any number of hands and fingers
Antoine Dailly, Valentin Gledel, Richard J. Nowakowski +1
Chopsticks is a game played by two players where they start with one finger raised on each hand. On their turn, each player moves by pointing an attacking hand at one of their oppo…