On the chromatic number of some geometric type Kneser graphs

  • Authors:

  • G. Araujo;A. Dumitrescu;F. Hurtado;M. Noy;J. Urrutia

  • Affiliations:

  • Instituto de Matemáticas, Universidad Nacional Autónoma de México, México D.F, Mexico;Department of Computer Science, University of Wisconsin--Milwaukee, 3200 N. Cramer Street, Milwaukee, WI 53211, USA;Dep. Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain;Dep. Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain;Instituto de Matemáticas, Universidad Nacional Autónoma de México, México D.F, Mexico

  • Venue:
  • Computational Geometry: Theory and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.