8 papers · 1 filter
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 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…
Incidence, a Scoring Positional Game on Graphs
Guillaume Bagan, Quentin Deschamps, Eric Duchêne +5
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investigated in the literature since then. These games are played on a hypergraph where…
Avoidance games are PSPACE-Complete
Valentin Gledel, Nacim Oijid
Avoidance games are games in which two players claim vertices of a hypergraph and try to avoid some structures. These games are studied since the introduction of the game of SIM in…
Maker-Breaker total domination game
Valentin Gledel, Michael A. Henning, Vesna Iršič +1
Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duchêne, Gledel, Parreau, and Renault.…
Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
Valentin Gledel, Vesna Iršič
The strong geodetic number, of a graph is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices…