The potential to improve the choice

DOI10.1145/1998196.1998266zbMath1283.05191arXiv1005.5520OpenAlexW1972678475MaRDI QIDQ5404457

Panagiotis Cheilaris, Marek Sulovský, Shakhar Smorodinsky

Publication date: 24 March 2014

Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

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

zbMATH Keywords

geometryhypergraphvertex coloringconflict-freeunique-maximum

Mathematics Subject Classification ID

Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Conflict-free coloring of intersection graphs of geometric objects

This page was built for publication: The potential to improve the choice