Coloring axis-parallel rectangles

DOI10.1016/J.JCTA.2009.04.007MaRDI QIDQ986114zbMATH OpenOpenAlexFDO

Authors János Pach, Gábor Tardos

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

chromatic numberhypergraphcoloring

Mathematics Subject Classification ID

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

Recommendations

• Coloring Axis-Parallel Rectangles
• On coloring points with respect to rectangles
• Coloring points with respect to squares
• Coloring points with respect to squares
• Indecomposable Coverings

Cites work

• scientific article; zbMATH DE number 3692179 (Why is no real title available?)
• Chromatic number of Hasse diagrams, eyebrows and dimension
• Coloring Geometric Range Spaces
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
• Conflict-free coloring of points and simple regions in the plane
• Covering the plane with convex polygons
• Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
• Indecomposable Coverings
• Multiple coverings of the plane with triangles
• On The Chromatic Number of Geometric Hypergraphs
• Research Problems in Discrete Geometry
• The Minimum Independence Number of a Hasse Diagram

Cited in

(22)

• Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
• Erratum to: ``Conflict-free chromatic art gallery coverage
• Proper coloring of geometric hypergraphs
• Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
• On grids in topological graphs
• Polychromatic colorings of rectangular partitions
• Conflict-free chromatic art gallery coverage
• Coloring half-planes and bottomless rectangles
• scientific article; zbMATH DE number 1452729 (Why is no real title available?)
• A ramsey-type bound for rectangles
• Coloring points with respect to squares
• Coloring points with respect to squares
• Colouring bottomless rectangles and arborescences
• Coloring Axis-Parallel Rectangles
• Coloring rectangular blocks in 3-space
• Stabbing boxes with finitely many axis-parallel lines and flats
• On variants of conflict-free-coloring for hypergraphs
• On coloring points with respect to rectangles
• On conflict-free multi-coloring
• Hook-free colorings and a problem of Hanson
• Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
• Tight lower bounds for the size of epsilon-nets

This page was built for publication: Coloring axis-parallel rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986114)