Disjointness graphs of segments
From MaRDI portal
Publication:4580137
DOI10.4230/LIPIcs.SoCG.2017.59zbMath1432.68365arXiv1704.01892MaRDI QIDQ4580137
János Pach, Géza Tóth, Gábor Tardos
Publication date: 13 August 2018
Full work available at URL: https://arxiv.org/abs/1704.01892
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (9)
On the connectivity of the disjointness graph of segments of point sets in general position in the plane ⋮ 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 ⋮ Coloring Hasse diagrams and disjointness graphs of curves ⋮ Box and Segment Intersection Graphs with Large Girth and Chromatic Number ⋮ Unnamed Item ⋮ On the chromatic number of disjointness graphs of curves ⋮ Hasse diagrams with large chromatic number
This page was built for publication: Disjointness graphs of segments
