Covering planar sets

DOI10.1070/SM2010v201n08ABEH004110zbMath1203.52014MaRDI QIDQ5893934

V. P. Filimonov

Publication date: 10 November 2010

Published in: Sbornik: Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberBorsuk problemcoverings of planar setsdiameter of a setuniversal covering sets and systems

Mathematics Subject Classification ID

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

Related Items (6)

Coverings of planar and three-dimensional sets with subsets of smaller diameter ⋮ Borsuk's problem, Boltyanski's illumination problem, and circumradius ⋮ On the partition of plane sets into 6 subsets of small diameter ⋮ Partition of three-dimensional sets into five parts of smaller diameter ⋮ Partition bounded sets into sets having smaller diameters ⋮ Covering planar sets

This page was built for publication: Covering planar sets