11 citations · 16 across the 4 of their papers we have counts for
5 papers
Connected Subtraction Games on Subdivided Stars
Antoine Dailly, Julien Moncel, Aline Parreau
The present paper deals with connected subtraction games in graphs, which are generalization of takeaway games. In a connected subtraction game, two players alternate removing a co…
Exact values for three domination-like problems in circular and infinite grid graphs of small height
Marwane Bouznif, Julien Darlay, Julien Moncel +1
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the mi…
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly +4
Octal games are a well-defined family of two-player games played on heaps of counters, in which the players remove alternately a certain number of counters from a heap, sometimes b…
Ice sliding games
Paul Dorbec, Eric Duchêne, André Fabbri +3
This paper deals with sliding games, which are a variant of the better known pushpush game. On a given structure (grid, torus...), a robot can move in a specific set of directions,…
New results on variants of covering codes in Sierpinski graphs
Sylvain Gravier, Matjaz Kovse, Michel Mollard +2
In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpinski graphs. We compute the minimum size of such codes in Sierpinski graphs…