On the chromatic number of some geometric type Kneser graphs

G. Araujo, A. Dumitrescu, F. Hurtado, M. Noy, J. Urrutia
2005 Computational geometry  
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. (A. Dumitrescu), hurtado@ma2.upc.es (F. Hurtado), noy@ma2.upc.es (M. Noy), urrutia@math.unam.mx (J. Urrutia).
doi:10.1016/j.comgeo.2004.10.003 fatcat:ldlordd5irh4jclg62zmggje7a