92 citations · 359 across the 37 of their papers we have counts for
Showing 2011 · math.COShow all
3 papers · 2 filters
math.CO2011★ 3 cited
An improved lower bound for (1,<=2)-identifying codes in the king grid
Florent Foucaud, Tero Laihonen, Aline Parreau
We call a subset of vertices of a graph a -identifying code if for all subsets of vertices with size at most , the sets $\{c\in C |\exists u \in X,…
math.CO2011★ 19 cited
Locally identifying colourings for graphs with given maximum degree
Florent Foucaud, Iiro Honkala, Tero Laihonen +2
A proper vertex-colouring of a graph G is said to be locally identifying if for any pair u,v of adjacent vertices with distinct closed neighbourhoods, the sets of colours in the cl…
math.CO2011★ 24 cited
Identifying codes in line graphs
Florent Foucaud, Sylvain Gravier, Reza Naserasr +2
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edg…