1 citations · 2 across the 6 of their papers we have counts for
1 paper · 1 filter
Michał Dębski, Jakub Przybyło
A vertex coloring of a given graph G is conflict-free if the closed neighborhood of every vertex contains a unique color (i.e. a color appearing only once in the neighborhood). T…