Publication:3886431
From MaRDI portal
zbMath0443.52017MaRDI QIDQ3886431
Publication date: 1980
05C15: Coloring of graphs and hypergraphs
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
Related Items
Decomposition of Multiple Packings with Subquadratic Union Complexity, Unsplittable coverings in the plane, Ramsey-type theorems for sets satisfying a geometric regularity condition, Octants are cover-decomposable, Indecomposable coverings with concave polygons, Decomposition of multiple coverings into more parts, Polychromatic coloring for half-planes, Colorful strips, Decomposition of multiple coverings into many parts, Coloring axis-parallel rectangles, Coloring geometric range spaces, Covering the plane with convex polygons, On closest pair in Euclidean metric: monochromatic is as hard as bichromatic, Multiple coverings with closed polygons, Proper coloring of geometric hypergraphs, Convex polygons are cover-decomposable, Octants are cover-decomposable into many coverings, Online and quasi-online colorings of wedges and intervals