Convex polygons are self-coverable

DOI10.1007/s00454-014-9582-9zbMath1302.52002arXiv1307.2411OpenAlexW2025955201MaRDI QIDQ741609

Dömötör Pálvölgyi, Balázs Keszegh

Publication date: 12 September 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2411

zbMATH Keywords

polychromatic coloringcover-decomposabilitygeometric hypergraph coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

Unsplittable coverings in the plane, Coloring points with respect to squares, Coloring Delaunay-edges and their generalizations, An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes, Proper coloring of geometric hypergraphs, Indecomposable coverings with homothetic polygons

Cites Work

• Unnamed Item
• Octants are cover-decomposable
• Concrete and abstract Voronoi diagrams
• Indecomposable coverings with homothetic polygons
• Octants are cover-decomposable into many coverings
• Making triangles colorful
• Making Octants Colorful and Related Covering Decomposition Problems
• Survey on Decomposition of Multiple Coverings