The following pages link to Indecomposable Coverings (Q5901346):
Displayed 18 items.
- Coloring planar homothets and three-dimensional hypergraphs (Q364847) (← links)
- Coloring half-planes and bottomless rectangles (Q452449) (← links)
- Indecomposable coverings with concave polygons (Q603839) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- Optimally decomposing coverings with translates of a convex polygon (Q635757) (← links)
- Polychromatic coloring for half-planes (Q645968) (← links)
- Colorful strips (Q659707) (← links)
- Coloring axis-parallel rectangles (Q986114) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q2207604) (← links)
- Indecomposable coverings with homothetic polygons (Q2351020) (← links)
- Convex polygons are cover-decomposable (Q2380774) (← links)
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles (Q3608310) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q5115820) (← links)
- Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs (Q5138972) (← links)
- Coloring Axis-Parallel Rectangles (Q5302752) (← links)
- Polychromatic colorings of unions of geometric hypergraphs (Q6039420) (← links)