92 citations · 359 across the 37 of their papers we have counts for
3 papers · 1 filter
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…
Acyclic edge-coloring using entropy compression
Louis Esperet, Aline Parreau
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta ha…
New results on variants of covering codes in Sierpinski graphs
Sylvain Gravier, Matjaz Kovse, Michel Mollard +2
In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpinski graphs. We compute the minimum size of such codes in Sierpinski graphs…