Proper coloring of geometric hypergraphs
From MaRDI portal
Publication:2324632
DOI10.1007/s00454-019-00096-9zbMath1430.68378OpenAlexW2945790009WikidataQ127937777 ScholiaQ127937777MaRDI QIDQ2324632
Dömötör Pálvölgyi, Balázs Keszegh
Publication date: 11 September 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-019-00096-9
Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unsplittable coverings in the plane
- Coloring planar homothets and three-dimensional hypergraphs
- Octants are cover-decomposable
- Coloring half-planes and bottomless rectangles
- Indecomposable coverings with concave polygons
- Polychromatic coloring for half-planes
- Convex polygons are self-coverable
- Coloring axis-parallel rectangles
- Coloring geometric range spaces
- Covering the plane with convex polygons
- Concrete and abstract Voronoi diagrams
- Neighborly inscribed polytopes and Delaunay triangulations
- Indecomposable coverings with homothetic polygons
- Convex polygons are cover-decomposable
- Octants are cover-decomposable into many coverings
- Multiple coverings of the plane with triangles
- Online and quasi-online colorings of wedges and intervals
- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes
- Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
- Topological Hypergraphs
- On the stretch factor of convex Delaunay graphs
- Making triangles colorful
- More on decomposing coverings by octants
- Research Problems in Discrete Geometry
- On the linear vertex-arboricity of a planar graph
- On The Chromatic Number of Geometric Hypergraphs
- Towards an implementation of the 3D visibility skeleton
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Regularity and Positional Games
- Decomposing Coverings and the Planar Sensor Cover Problem
- Making Octants Colorful and Related Covering Decomposition Problems
- Survey on Decomposition of Multiple Coverings
- Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
- Indecomposable Coverings
- Acyclic colorings of planar graphs
This page was built for publication: Proper coloring of geometric hypergraphs
