CONFLICT-FREE COLORINGS OF SHALLOW DISCS
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computational aspects related to convexity (52B55) Oriented matroids in discrete geometry (52C40) Analysis of algorithms (68W40) Communication networks in operations research (90B18) Communication theory (94A05)
Recommendations
Cites work
- Applications of random sampling in computational geometry. II
- Conflict-free coloring of points and simple regions in the plane
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Discrete and computational geometry. The Goodman-Pollack Festschrift
- On The Chromatic Number of Geometric Hypergraphs
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Online Conflict‐Free Coloring for Intervals
Cited in
(10)- Conflict-free coloring of unit disks
- Conflict-free coloring of string graphs
- Essentially disjoint families, conflict free colorings and Shelah's revised GCH
- Conflict-free coloring made stronger
- A lower bound on the area of a 3-coloured disk packing
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-free coloring of points on a line with respect to a set of intervals
- On variants of conflict-free-coloring for hypergraphs
- Conflict free colorings of nonuniform systems of infinite sets
This page was built for publication: CONFLICT-FREE COLORINGS OF SHALLOW DISCS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604140)
