On the chromatic number of some geometric hypergraphs

DOI10.1145/1109557.1109593zbMath1192.05058OpenAlexW4255489463MaRDI QIDQ3581577

Shakhar Smorodinsky

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109593

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Coloring Axis-Parallel Rectangles, Existence of planar support for geometric hypergraphs using elementary techniques, Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors, Dynamic Offline Conflict-Free Coloring for Unit Disks, Coloring geometric range spaces, Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces