Coloring axis-parallel rectangles

DOI10.1016/j.jcta.2009.04.007zbMath1221.05160OpenAlexW2064723783MaRDI QIDQ986114

Gábor Tardos, János Pach

Publication date: 11 August 2010

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.2009.04.007

zbMATH Keywords

hypergraphchromatic numbercoloring

Mathematics Subject Classification ID

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

Related Items

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries, On Conflict-Free Multi-coloring, Coloring points with respect to squares, Colouring bottomless rectangles and arborescences, Conflict-free chromatic art gallery coverage, Erratum to: ``Conflict-free chromatic art gallery coverage, Coloring half-planes and bottomless rectangles, On variants of conflict-free-coloring for hypergraphs, On grids in topological graphs, Tight lower bounds for the size of epsilon-nets, Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles, Proper coloring of geometric hypergraphs

Cites Work

• Unnamed Item
• Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
• Covering the plane with convex polygons
• Chromatic number of Hasse diagrams, eyebrows and dimension
• Multiple coverings of the plane with triangles
• Conflict-free coloring of points and simple regions in the plane
• Research Problems in Discrete Geometry
• On The Chromatic Number of Geometric Hypergraphs
• Towards an implementation of the 3D visibility skeleton
• Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Coloring Geometric Range Spaces
• The Minimum Independence Number of a Hasse Diagram
• Indecomposable Coverings