Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
From MaRDI portal
Publication:3608310
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational aspects related to convexity (52B55) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cites work
- Chromatic number of Hasse diagrams, eyebrows and dimension
- Coloring axis-parallel rectangles
- Computational geometry algorithms for the systolic screen
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Conflict-free coloring of points and simple regions in the plane
- Conflict-Free Colorings of Rectangles Ranges
- CONFLICT-FREE COLORINGS OF SHALLOW DISCS
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Covering the plane with convex polygons
- Fast algorithms for direct enclosures and direct dominances
- Indecomposable Coverings
- On rectangular visibility
- On The Chromatic Number of Geometric Hypergraphs
- On the independence number of sparse graphs
- Online Conflict‐Free Coloring for Intervals
- Research Problems in Discrete Geometry
Cited in
(27)- Coloring points with respect to squares
- Coloring Delaunay-edges and their generalizations
- Dushnik-Miller dimension of TD-Delaunay complexes
- Proper coloring of geometric hypergraphs
- scientific article; zbMATH DE number 5764872 (Why is no real title available?)
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Tight lower bounds for the size of epsilon-nets
- Hitting and Piercing Rectangles Induced by a Point Set
- Improved Ramsey-type results for comparability graphs
- Hasse diagrams with large chromatic number
- On variants of conflict-free-coloring for hypergraphs
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- Coloring Axis-Parallel Rectangles
- Nice point sets can have nasty Delaunay triangulations
- Matching random colored points with rectangles
- Polychromatic colorings of unions of geometric hypergraphs
- Colouring bottomless rectangles and arborescences
- Coloring lines and Delaunay graphs with respect to boxes
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- Dushnik-Miller dimension of stair contact complexes
- Word-representable graphs: orientations, posets, and bounds
- Stabbing boxes with finitely many axis-parallel lines and flats
- Polychromatic colorings of geometric hypergraphs via shallow hitting sets
- Hitting sets and colorings of hypergraphs
- Title not available (Why is no real title available?)
- Witness rectangle graphs
- Coloring axis-parallel rectangles
This page was built for publication: Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608310)
