DeepAI AI Chat
Log In Sign Up

The exact chromatic number of the convex segment disjointness graph

by   Ruy Fabila-Monroy, et al.
Monash University

Let P be a set of n points in strictly convex position in the plane. Let D_n be the graph whose vertex set is the set of all line segments with endpoints in P, where disjoint segments are adjacent. The chromatic number of this graph was first studied by Araujo, Dumitrescu, Hurtado, Noy, and Urrutia [2005] and then by Dujmović and Wood [2007]. Improving on their estimates, we prove the following exact formula: χ(D_n) = n - √(2n + 14) - 12.


page 1

page 2

page 3

page 4


On sets of n points in general position that determine lines that can be pierced by n points

Let P be a set of n points in general position in the plane. Let R be a ...

Convex Hull Thrackles

A thrackle is a graph drawn in the plane so that every pair of its edges...

Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane

Let E={e_1,…,e_n} be a set of C-oriented disjoint segments in the plane,...

Variable degeneracy on toroidal graphs

Let f be a nonnegative integer valued function on the vertex-set of a gr...

Short Flip Sequences to Untangle Segments in the Plane

A (multi)set of segments in the plane may form a TSP tour, a matching, a...

Caterpillars and alternating paths

Let p(m) (respectively, q(m)) be the maximum number k such that any tree...

Deterministic Linear Time Constrained Triangulation using Simplified Earcut

Triangulation algorithms that conform to a set of non-intersecting input...