Coloring Axis-Parallel Rectangles

DOI10.1007/978-3-540-89550-3_19zbMath1162.05318OpenAlexW2395654667MaRDI QIDQ5302752

Gábor Tardos, János Pach

Publication date: 13 January 2009

Published in: Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/129411/files/rectangles081707.pdf

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
• Coloring geometric range spaces
• 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 some 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
• The Minimum Independence Number of a Hasse Diagram
• Indecomposable Coverings

This page was built for publication: Coloring Axis-Parallel Rectangles