Proper Coloring of Geometric Hypergraphs
Open Access
- 15 May 2019
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 62 (3) , 674-689
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- H2020 Marie Sklodowska-Curie Actions (IF 660400)
- Magyar Tudományos Akadémia (LP2017-19/2017, LP2017-19/2017)
This publication has 29 references indexed in Scilit:
- Neighborly inscribed polytopes and delaunay triangulationsAdvances in Geometry, 2016
- Colouring Planar Graphs With Three Colours and No Large Monochromatic ComponentsCombinatorics, Probability and Computing, 2014
- Making Octants Colorful and Related Covering Decomposition ProblemsSIAM Journal on Discrete Mathematics, 2014
- Coloring planar homothets and three-dimensional hypergraphsComputational Geometry, 2013
- Topological Hypergraphs2012
- Decomposing Coverings and the Planar Sensor Cover Problem2009
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectanglesRandom Structures & Algorithms, 2008
- Coloring Geometric Range SpacesDiscrete & Computational Geometry, 2008
- Acyclic colorings of planar graphsDiscrete Mathematics, 1991
- Regularity and positional gamesTransactions of the American Mathematical Society, 1963