On The Chromatic Number of Geometric Hypergraphs

DOI10.1137/050642368zbMath1141.05064OpenAlexW2013760641MaRDI QIDQ3519201

Shakhar Smorodinsky

Publication date: 13 August 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050642368

zbMATH Keywords

hypergraphscoloringwirelessconflict-free

Mathematics Subject Classification ID

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

Related Items (21)

On the union complexity of families of axis-parallel rectangles with a low packing number ⋮ On Conflict-Free Multi-coloring ⋮ Coloring planar homothets and three-dimensional hypergraphs ⋮ Conflict-free coloring of intersection graphs of geometric objects ⋮ Coloring intersection hypergraphs of pseudo-disks ⋮ Applying a hypergraph to determine the structure of some finite modules ⋮ Conflict-free chromatic art gallery coverage ⋮ Erratum to: ``Conflict-free chromatic art gallery coverage ⋮ Coloring half-planes and bottomless rectangles ⋮ Colorful strips ⋮ Conflict-Free Colourings of Graphs and Hypergraphs ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Online Conflict-Free Colouring for Hypergraphs ⋮ Conflict-free coloring of string graphs ⋮ Coloring axis-parallel rectangles ⋮ CONFLICT-FREE COLORINGS OF SHALLOW DISCS ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs ⋮ On the shortest separating cycle ⋮ Proper coloring of geometric hypergraphs ⋮ Coloring intersection hypergraphs of pseudo-disks

This page was built for publication: On The Chromatic Number of Geometric Hypergraphs