92 citations · 359 across the 37 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012
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…
math.CO2012★ 92 cited
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…