On the chromatic number of disjointness graphs of curves
From MaRDI portal
Publication:777485
DOI10.1016/j.jctb.2020.02.003zbMath1443.05075arXiv1811.09158OpenAlexW3005676211MaRDI QIDQ777485
Publication date: 7 July 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.09158
Related Items (7)
Coloring polygon visibility graphs and their generalizations ⋮ Disjointness graphs of short polygonal chains ⋮ Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian ⋮ Coloring lines and Delaunay graphs with respect to boxes ⋮ A better upper bound on the chromatic number of (cap, even-hole)-free graphs ⋮ Improved Ramsey-type results for comparability graphs ⋮ Hasse diagrams with large chromatic number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The clique problem in ray intersection graphs
- Triangle-free intersection graphs of line segments with large chromatic number
- Coloring intersection graphs of arc-connected sets in the plane
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Minimum clique partition in unit disk graphs
- Ramsey-type constructions for arrangements of segments
- On the chromatic number of multiple interval graphs and overlap graphs
- Circle orders, n-gon orders and the crossing number
- Some geometric applications of Dilworth's theorem
- Intersection graphs of segments
- Covering and coloring polygon-circle graphs
- Ramsey-type results for geometric graphs. I
- The maximum number of unit distances in a convex \(n\)-gon
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Forbidden paths and cycles in ordered graphs and matrices
- Independent set of intersection graphs of convex objects in 2D
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- A decomposition theorem for partially ordered sets
- Research Problems in Discrete Geometry
- On a Coloring Problem.
- A Ramsey-Type Result for Convex Sets
- On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
- Coloring curves that cross a fixed curve
- Disjointness graphs of segments
- Outerstring graphs are χ-bounded
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- String graphs and incomparability graphs
- Colouring arcwise connected sets in the plane. I
This page was built for publication: On the chromatic number of disjointness graphs of curves
