scientific article; zbMATH DE number 7559254
From MaRDI portal
Publication:5088986
DOI10.4230/LIPIcs.SoCG.2019.54MaRDI QIDQ5088986
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Disjointness graphs of segments in the space, Coloring Hasse diagrams and disjointness graphs of curves, On grounded \(\llcorner\)-graphs and their relatives, Outerstring Graphs are $\chi$-Bounded
Cites Work
- 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
- Some geometric applications of Dilworth's theorem
- Intersection graphs of segments
- Covering and coloring polygon-circle graphs
- The maximum number of unit distances in a convex \(n\)-gon
- 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
- Improved Ramsey-type results for comparability graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- A Dual of Dilworth's Decomposition Theorem
- Colouring arcwise connected sets in the plane. I
