92 citations · 359 across the 37 of their papers we have counts for
4 papers · 2 filters
Locally identifying coloring of graphs
Louis Esperet, Sylvain Gravier, Mickael Montassier +2
We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring c of a graph G is said to be locally identifying, if for any adjacent vertices u and v…
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
Florent Foucaud, Reza Naserasr, Aline Parreau
An identifying code of a (di)graph is a dominating subset of the vertices of such that all distinct vertices of have distinct (in)neighbourhoods within . In this…
Extremal graphs for the identifying code problem
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse +3
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at mo…
On two variations of identifying codes
Olivier Delmas, Sylvain Gravier, Mickael Montassier +1
Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and l…