5 citations · 10 across the 7 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.CO2010★ 1 cited
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský
Given a geometric hypergraph (or a range-space) , a coloring of its vertices is said to be conflict-free if for every hyperedge there is at least one v…
math.CO2010★ 3 cited
Unique-maximum and conflict-free colorings for hypergraphs and tree graphs
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi
We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors…