| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10327445 | Computational Geometry | 2005 | 11 Pages |
Abstract
We estimate the chromatic number of graphs whose vertex set is the set of edges of a complete geometric graph on n points, and adjacency is defined in terms of geometric disjointness or geometric intersection.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
G. Araujo, A. Dumitrescu, F. Hurtado, M. Noy, J. Urrutia,