Covering planar sets
From MaRDI portal
Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Recommendations
Cites work
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Borsuk's problem and the chromatic numbers of some metric spaces
- Bounds on Borsuk numbers in distance graphs of a special type
- Counterexamples to Borsuk's conjecture with large girth
- Covering planar sets
- Drei Sätze über die n-dimensionale euklidische Sphäre
- scientific article; zbMATH DE number 3888438 (Why is no real title available?)
- New bounds for the clique-chromatic numbers of Johnson graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- On dividing sets into parts of smaller diameter
- Ramsey theory in the \(n\)-space with Chebyshev metric
- Thirty Essays on Geometric Graph Theory
- Zerlegung ebener Bereiche in konvexe Zellen von möglichst kleinem Durchmesser
Cited in
(7)- Bounds for optimal coverings
- Coverings of planar and three-dimensional sets with subsets of smaller diameter
- Covering paths for planar point sets
- Covering a planar domain with sets of small diameter
- scientific article; zbMATH DE number 3900774 (Why is no real title available?)
- scientific article; zbMATH DE number 124002 (Why is no real title available?)
- Borsuk's problem, Boltyanski's illumination problem, and circumradius
This page was built for publication: Covering planar sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919143)
