92 citations · 359 across the 37 of their papers we have counts for
4 papers · 1 filter
Locating-dominating sets: from graphs to oriented graphs
Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä +1
A locating-dominating set in an undirected graph is a subset of vertices such that is dominating and for every , we have . In this p…
Metric dimension on sparse graphs and its applications to zero forcing sets
Nicolas Bousquet, Quentin Deschamps, Aline Parreau +1
The metric dimension dim(G) of a graph is the minimum cardinality of a subset of vertices of such that each vertex of is uniquely determined by its distances to …
Locating Dominating Sets in local tournaments
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque +1
A dominating set in a directed graph is a set of vertices such that all the vertices that do not belong to have an in-neighbour in . A locating set is a set of verti…
Partizan Subtraction Games
Eric Duchêne, Marc Heinrich, Richard J. Nowakowski +1
Partizan subtraction games are combinatorial games where two players, say Left and Right, alternately remove a number n of tokens from a heap of tokens, with (resp. $n…