Coloring lines and Delaunay graphs with respect to boxes
From MaRDI portal
Publication:6201036
DOI10.1002/rsa.21193arXiv2301.10129OpenAlexW4318146633MaRDI QIDQ6201036
Publication date: 25 March 2024
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.10129
Computational aspects related to convexity (52B55) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangle-free intersection graphs of line segments with large chromatic number
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- On the chromatic number of disjointness graphs of curves
- On the chromatic number of multiple interval graphs and overlap graphs
- On the number of graphs without 4-cycles
- On point covers of parallel rectangles
- Covering lattice points by subspaces and counting point-hyperplane incidences
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
- Triangle-free geometric intersection graphs with no large independent sets
- Conflict-free coloring of points and simple regions in the plane
- On a Coloring Problem.
- Lower bounds for orthogonal range searching: I. The reporting case
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- A Ramsey-Type Result for Convex Sets
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Separation dimension and sparsity
- Disjointness graphs of segments
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Separation dimension and degree
- Hasse diagrams with large chromatic number
- Improved bounds for colouring circle graphs
- Zarankiewicz’s problem for semilinear hypergraphs
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number
- Outerstring Graphs are $\chi$-Bounded
- Conflict-Free Coloring and its Applications
- Applications of a New Separator Theorem for String Graphs
- Turán-type results for intersection graphs of boxes
- Covering lattice points by subspaces
- Ramsey properties of semilinear graphs
This page was built for publication: Coloring lines and Delaunay graphs with respect to boxes
