5 citations · 10 across the 7 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012
Strong Conflict-Free Coloring of Intervals
Luisa Gargano, Adele A. Rescigno
We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the colo…
math.CO2012★ 5 cited
Conflict-free coloring with respect to a subset of intervals
Panagiotis Cheilaris, Shakhar Smorodinsky
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S \in E there is at least one vertex in S whose color is distinct from…