Octants are cover-decomposable into many coverings

DOI10.1016/j.comgeo.2013.12.001zbMath1285.05061arXiv1207.0672MaRDI QIDQ2444310

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

Publication date: 9 April 2014

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

geometric hypergraph coloring; cover-decomposition

Mathematics Subject Classification ID

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

Related Items

Unsplittable coverings in the plane, Convex polygons are self-coverable, Coloring points with respect to squares, Proper coloring of geometric hypergraphs, Online and quasi-online colorings of wedges and intervals, An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes

Cites Work

• Unnamed Item
• Unnamed Item
• Octants are cover-decomposable
• Coloring half-planes and bottomless rectangles
• Indecomposable coverings with concave polygons
• Decomposition of multiple coverings into more parts
• Optimally decomposing coverings with translates of a convex polygon
• Decomposition of multiple coverings into many parts
• Covering the plane with convex polygons
• Convex polygons are cover-decomposable
• Multiple coverings of the plane with triangles
• Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
• Weighted geometric set cover via quasi-uniform sampling
• Coloring Planar Homothets and Three-Dimensional Hypergraphs
• Online and Quasi-online Colorings of Wedges and Intervals
• Indecomposable Coverings