Locally identifying coloring in bounded expansion classes of graphs

Daniel Gonçalves, Aline Parreau, Alexandre Pinlou

A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-c…