Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
From MaRDI portal
Publication:2842144
DOI10.1007/978-3-642-40104-6_7zbMath1391.68104arXiv1302.2426OpenAlexW1480239727MaRDI QIDQ2842144
No author found.
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2426
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
Unsplittable coverings in the plane ⋮ Polychromatic colorings of unions of geometric hypergraphs ⋮ Colouring bottomless rectangles and arborescences ⋮ Octants are cover-decomposable into many coverings ⋮ Searching a Tree with Permanently Noisy Advice ⋮ Coloring Delaunay-edges and their generalizations ⋮ Online and quasi-online colorings of wedges and intervals ⋮ Proper coloring of geometric hypergraphs
This page was built for publication: Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
