Conflict-Free Coloring Made Stronger

DOI10.1007/978-3-642-13731-0_11zbMath1284.05100arXiv1006.2926OpenAlexW3124376956MaRDI QIDQ3569883

Roi Krakovski, Elad Aigner-Horev, Shakhar Smorodinsky

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.2926

zbMATH Keywords

discrete geometrywireless networksgeometric hypergraphsconflict-free colorings

Mathematics Subject Classification ID

Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Dynamic conflict-free colorings in the plane ⋮ Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Coloring planar homothets and three-dimensional hypergraphs ⋮ A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs ⋮ Strong conflict-free coloring for intervals ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Conflict-free coloring of string graphs ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points ⋮ Unnamed Item ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ⋮ Dynamic Conflict-Free Colorings in the Plane

This page was built for publication: Conflict-Free Coloring Made Stronger