Coloring planar homothets and three-dimensional hypergraphs

DOI10.1016/j.comgeo.2013.06.004zbMath1270.05038OpenAlexW1843684924MaRDI QIDQ364847

Jean Cardinal, Matias Korman

Publication date: 3 September 2013

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0925772113000825

zbMATH Keywords

chromatic numbershypergraph coloring4-color theoremconflict-free coloringgeometric hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Coloring intersection hypergraphs of pseudo-disks, Proper coloring of geometric hypergraphs, Coloring intersection hypergraphs of pseudo-disks

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring geometric range spaces
• Planar graphs and poset dimension
• Dimension and automorphism groups of lattices
• Every planar graph is 5-choosable
• Conflict-free coloring of points and simple regions in the plane
• On the stretch factor of convex Delaunay graphs
• ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
• On The Chromatic Number of Geometric Hypergraphs
• Conflict-Free Coloring Made Stronger
• Towards an implementation of the 3D visibility skeleton
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Decomposing Coverings and the Planar Sensor Cover Problem
• Indecomposable Coverings