Indecomposable Coverings

DOI10.1007/978-3-540-70666-3_15zbMath1149.52304OpenAlexW2912897063MaRDI QIDQ5901346

János Pach, Géza Tóth, Gábor Tardos

Publication date: 28 August 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70666-3_15

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (18)

Convex polygons are cover-decomposable ⋮ Coloring Axis-Parallel Rectangles ⋮ Coloring planar homothets and three-dimensional hypergraphs ⋮ 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 ⋮ Coloring intersection hypergraphs of pseudo-disks ⋮ Polychromatic coloring for half-planes ⋮ Coloring half-planes and bottomless rectangles ⋮ Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs ⋮ Colorful strips ⋮ Conflict-free coloring of string graphs ⋮ Coloring axis-parallel rectangles ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles ⋮ Coloring geometric range spaces ⋮ Indecomposable coverings with homothetic polygons ⋮ Coloring intersection hypergraphs of pseudo-disks

This page was built for publication: Indecomposable Coverings