Polychromatic coloring for half-planes

DOI10.1016/j.jcta.2011.07.001zbMath1232.05151OpenAlexW2094057361MaRDI QIDQ645968

Shakhar Smorodinsky, Yelena Yuditsky

Publication date: 11 November 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2011.07.001

zbMATH Keywords

discrete geometryepsilon netspolychromatic coloringcover decomposable

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Small strong epsilon nets ⋮ Polychromatic colorings of unions of geometric hypergraphs ⋮ Coloring points with respect to squares ⋮ Coloring Delaunay-edges and their generalizations ⋮ An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes ⋮ Discrete Helly-type theorems for pseudohalfplanes ⋮ Proper coloring of geometric hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Indecomposable coverings with concave polygons
• Decomposition of multiple coverings into more parts
• Colorful strips
• Decomposition of multiple coverings into many parts
• Coloring geometric range spaces
• \(\epsilon\)-nets and simplex range queries
• Almost tight bounds for \(\epsilon\)-nets
• Convex polygons are cover-decomposable
• Multiple coverings of the plane with triangles
• Decomposing Coverings and the Planar Sensor Cover Problem
• Indecomposable Coverings

This page was built for publication: Polychromatic coloring for half-planes