On The Chromatic Number of Geometric Hypergraphs

DOI10.1137/050642368zbMATH Open1141.05064OpenAlexW2013760641MaRDI QIDQ3519201FDOQ3519201

Authors: 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

Recommendations

• Coloring half-planes and bottomless rectangles
• Coloring intersection hypergraphs of pseudo-disks
• Coloring intersection hypergraphs of pseudo-disks
• Conflict-free coloring made stronger
• Coloring planar homothets and three-dimensional hypergraphs

zbMATH Keywords

hypergraphscoloringwirelessconflict-free

Mathematics Subject Classification ID

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

Cited In (31)

• Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
• The complexity of recognizing geometric hypergraphs
• CONFLICT-FREE COLORINGS OF SHALLOW DISCS
• Erratum to: ``Conflict-free chromatic art gallery coverage
• Proper coloring of geometric hypergraphs
• Conflict-free coloring made stronger
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
• On the shortest separating cycle
• Polychromatic colorings of unions of geometric hypergraphs
• On the union complexity of families of axis-parallel rectangles with a low packing number
• Exactly hittable interval graphs
• Conflict-free coloring of string graphs
• Conflict-free chromatic art gallery coverage
• Coloring intersection hypergraphs of pseudo-disks
• Coloring half-planes and bottomless rectangles
• Conflict-free coloring of intersection graphs of geometric objects
• Conflict-free colouring of subsets
• Coloring axis-parallel rectangles
• Studying some semisimple modules via hypergraphs
• On conflict-free multi-coloring
• On variants of conflict-free-coloring for hypergraphs
• Colorful strips
• Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
• Coloring intersection hypergraphs of pseudo-disks
• Title not available (Why is that?)
• Coloring planar homothets and three-dimensional hypergraphs
• On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
• Coloring a set of touching strings
• Applying a hypergraph to determine the structure of some finite modules
• Online conflict-free colouring for hypergraphs
• Conflict-free colourings of graphs and hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519201)