Skip to main content
Conference Proceedings

The chromatic number of the convex segment disjointness graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7579 LNCS 79-84
DOI: 10.1007/978-3-642-34191-5_7
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let P be a set of n points in general and convex position in the plane. Let Dn 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 et al. [CGTA, 2005]. The previous best bounds are 3n/4 ≤ χ(Dn)

Cite

CITATION STYLE

APA

Fabila-Monroy, R., & Wood, D. R. (2012). The chromatic number of the convex segment disjointness graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7579 LNCS, pp. 79–84). https://doi.org/10.1007/978-3-642-34191-5_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free