The following pages link to (Q3886431):
Displaying 20 items.
- Unsplittable coverings in the plane (Q317324) (← links)
- Ramsey-type theorems for sets satisfying a geometric regularity condition (Q342924) (← links)
- Octants are cover-decomposable (Q411409) (← links)
- Indecomposable coverings with concave polygons (Q603839) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- Polychromatic coloring for half-planes (Q645968) (← links)
- Colorful strips (Q659707) (← links)
- Decomposition of multiple coverings into many parts (Q955226) (← links)
- Coloring axis-parallel rectangles (Q986114) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Covering the plane with convex polygons (Q1077728) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Multiple coverings with closed polygons (Q2256112) (← links)
- Proper coloring of geometric hypergraphs (Q2324632) (← links)
- Convex polygons are cover-decomposable (Q2380774) (← links)
- Octants are cover-decomposable into many coverings (Q2444310) (← links)
- Online and quasi-online colorings of wedges and intervals (Q2520715) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)
- Colouring bottomless rectangles and arborescences (Q6110074) (← links)
