Coloring half-planes and bottomless rectangles

DOI10.1016/j.comgeo.2011.09.004zbMath1248.05068arXiv1105.0169OpenAlexW2016829899MaRDI QIDQ452449

Balázs Keszegh

Publication date: 21 September 2012

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

half-planegeometric hypergraphconflict-free coloringaxis-parallel rectangleproper hypergraph coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Polychromatic colorings of unions of geometric hypergraphs ⋮ Coloring points with respect to squares ⋮ Colouring bottomless rectangles and arborescences ⋮ Coloring intersection hypergraphs of pseudo-disks ⋮ Octants are cover-decomposable into many coverings ⋮ Coloring Delaunay-edges and their generalizations ⋮ Online and quasi-online colorings of wedges and intervals ⋮ 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 ⋮ Coloring intersection hypergraphs of pseudo-disks

Cites Work

• Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
• Coloring axis-parallel rectangles
• Conflict-free coloring of points and simple regions in the plane
• On The Chromatic Number of Geometric Hypergraphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Indecomposable Coverings
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring half-planes and bottomless rectangles