Indecomposable Coverings
From MaRDI portal
Publication:5895103
DOI10.4153/CMB-2009-048-XzbMATH Open1245.52008MaRDI QIDQ5895103FDOQ5895103
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)
Recommendations
Coloring of graphs and hypergraphs (05C15) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cited In (12)
- Coloring Delaunay-edges and their generalizations
- Borsuk's covering for blunt bodies
- Proper coloring of geometric hypergraphs
- On the number of points in general position in the plane
- Unsplittable coverings in the plane
- Octants are cover-decomposable
- A non-linear lower bound for planar epsilon-nets
- Coloring points with respect to squares
- Coloring Axis-Parallel Rectangles
- Tight lower bounds for the size of epsilon-nets
- Indecomposable Coverings
- Octants are cover-decomposable into many coverings
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)