Indecomposable Coverings

DOI10.4153/CMB-2009-048-XzbMATH Open1245.52008MaRDI QIDQ5895103FDOQ5895103

Authors János Pach, Gábor Tardos, Géza Tóth 

Publication date 15 October 2009

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

\(k\)-fold coverings of the planecoloring of points

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Indecomposable Coverings
• Indecomposable coverings with concave polygons
• Indecomposable coverings with homothetic polygons
• Multiple coverings with closed polygons
• Covering the plane with convex polygons

Cited in

(14)

• Indecomposable Coverings
• A non-linear lower bound for planar epsilon-nets
• Proper coloring of geometric hypergraphs
• Coloring Delaunay-edges and their generalizations
• Octants are cover-decomposable
• Coloring Axis-Parallel Rectangles
• Borsuk's covering for blunt bodies
• On the number of points in general position in the plane
• Coloring axis-parallel rectangles
• Coloring points with respect to squares
• Tight lower bounds for the size of epsilon-nets
• Octants are cover-decomposable into many coverings
• A note on the pyjama problem
• Indecomposable coverings with homothetic polygons

This page was built for publication: Indecomposable Coverings

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