7 citations · 18 across the 14 of their papers we have counts for
5 papers · 1 filter
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…
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In the Levenshtein's sequence reconstruction problem a codeword is transmitted through channels and in each channel a set of errors is introduced to the transmitted word. In pr…
Identifying codes in triangle-free graphs of bounded maximum degree
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
An identifying code of a closed-twin-free graph is a set of vertices of such that any two vertices in have a distinct, nonempty intersection between their closed ne…
Resolving Sets in Temporal Graphs
Jan Bok, Antoine Dailly, Tuomo Lehtilä
A \emph{resolving set} in a graph is a set of vertices such that every vertex of is uniquely identified by its distances to the vertices of . Introduced in the 1970s…
Identifying codes in graphs of given maximum degree: Characterizing trees
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
An identifying code of a closed-twin-free graph is a dominating set of vertices of such that any two vertices in have a distinct intersection between their closed n…