scientific article
From MaRDI portal
Publication:3886431
zbMath0443.52017MaRDI QIDQ3886431
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (21)
Covering the plane with convex polygons ⋮ Convex polygons are cover-decomposable ⋮ Unsplittable coverings in the plane ⋮ Ramsey-type theorems for sets satisfying a geometric regularity condition ⋮ Indecomposable coverings with concave polygons ⋮ Decomposition of multiple coverings into more parts ⋮ Polychromatic colorings of unions of geometric hypergraphs ⋮ Colouring bottomless rectangles and arborescences ⋮ Octants are cover-decomposable ⋮ Decomposition of Multiple Packings with Subquadratic Union Complexity ⋮ Polychromatic coloring for half-planes ⋮ Octants are cover-decomposable into many coverings ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Colorful strips ⋮ Decomposition of multiple coverings into many parts ⋮ Multiple coverings with closed polygons ⋮ Coloring axis-parallel rectangles ⋮ Online and quasi-online colorings of wedges and intervals ⋮ Coloring geometric range spaces ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ Proper coloring of geometric hypergraphs
This page was built for publication:
