The Chromatic Number of the Convex Segment Disjointness Graph

DOI10.1007/978-3-642-34191-5_7zbMath1375.68131arXiv1105.4931OpenAlexW2963238352MaRDI QIDQ4899266

David R. Wood, Ruy Fabila-Monroy

Publication date: 7 January 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.4931

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Geometric achromatic and pseudoachromatic indices ⋮ On the connectivity of the disjointness graph of segments of point sets in general position in the plane ⋮ Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian ⋮ Blocking the \(k\)-holes of point sets in the plane

Cites Work

• Outerplanar thrackles
• Generalized thrackle drawings of non-bipartite graphs
• On Conway's thrackle conjecture
• Bounds for generalized thrackles
• On the chromatic number of some geometric type Kneser graphs

This page was built for publication: The Chromatic Number of the Convex Segment Disjointness Graph