Making Octants Colorful and Related Covering Decomposition Problems
From MaRDI portal
Publication:5246096
DOI10.1137/140955975zbMath1309.05068arXiv1307.2705OpenAlexW2062254047MaRDI QIDQ5246096
Piotr Micek, Jean Cardinal, Torsten Ueckerdt, Kolja Knauer
Publication date: 17 April 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.2705
Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Online algorithms; streaming algorithms (68W27)
Related Items (8)
Unsplittable coverings in the plane ⋮ Polychromatic colorings of unions of geometric hypergraphs ⋮ Coloring points with respect to squares ⋮ Colouring bottomless rectangles and arborescences ⋮ Online and quasi-online colorings of wedges and intervals ⋮ Convex polygons are self-coverable ⋮ An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes ⋮ Proper coloring of geometric hypergraphs
This page was built for publication: Making Octants Colorful and Related Covering Decomposition Problems
