Indecomposable Coverings
From MaRDI portal
Recommendations
Cited in
(27)- Coloring geometric range spaces
- Borsuk's covering for blunt bodies
- Conflict-free coloring of string graphs
- Coloring intersection hypergraphs of pseudo-disks
- Indecomposable coverings with homothetic polygons
- Convex polygons are cover-decomposable
- A note on the pyjama problem
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Coloring planar homothets and three-dimensional hypergraphs
- scientific article; zbMATH DE number 3915124 (Why is no real title available?)
- Coloring half-planes and bottomless rectangles
- Coloring intersection hypergraphs of pseudo-disks
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- Coloring Axis-Parallel Rectangles
- Indecomposable Coverings
- Indecomposable coverings with concave polygons
- Decomposition of multiple coverings into more parts
- Polychromatic colorings of unions of geometric hypergraphs
- Optimally decomposing coverings with translates of a convex polygon
- Polychromatic coloring for half-planes
- Colorful strips
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- Polychromatic colorings of geometric hypergraphs via shallow hitting sets
- Realizing an m-uniform four-chromatic hypergraph with disks
- Polychromatic coloring of tuples in hypergraphs
- On spheres with k points inside
- Coloring axis-parallel rectangles
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 Q5901346)
