Polychromatic colorings of unions of geometric hypergraphs

DOI10.1007/978-3-031-15914-5_11arXiv2112.02894OpenAlexW4312757133MaRDI QIDQ6039420

Vera Chekan, Torsten Ueckerdt

Publication date: 5 May 2023

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphcoloringpolychromatic coloringrange space

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unsplittable coverings in the plane
• Coloring half-planes and bottomless rectangles
• Polychromatic coloring for half-planes
• Colorful strips
• Covering the plane with convex polygons
• The max clique problem in classes of string-graphs
• Coloring points with respect to squares
• Indecomposable coverings with homothetic polygons
• Convex polygons are cover-decomposable
• Online and quasi-online colorings of wedges and intervals
• Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
• Weighted geometric set cover via quasi-uniform sampling
• More on decomposing coverings by octants
• Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
• An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
• Tight lower bounds for the size of epsilon-nets
• Decomposing Coverings and the Planar Sensor Cover Problem
• Making Octants Colorful and Related Covering Decomposition Problems
• Survey on Decomposition of Multiple Coverings
• Indecomposable Coverings

This page was built for publication: Polychromatic colorings of unions of geometric hypergraphs