Bounds on the chromatic number of intersection graphs of sets in the plane

Discrete Mathematics

Volumn 262, Issue 1-3, 2003, Pages 221-227

  Perepelitsa, I G ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Clique number; Coloring; Intersection graphs

Indexed keywords

EID: 84867977134     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00501-0     Document Type: Article

References (7)

1. J. Akiyama, K. Hosono, M. Urabe, Unit cube's problem, Discrete Math. 166 (1993) 297-298.
2. E. Asplund, B. Grunbaum, On a coloring problem, Math. Scand. 8 (1960) 181-188.
3. J.P. Burling, On coloring problems off amilies ofprototypes, Ph.D. Thesis, University ofColorado, Boulder, CO, 1965.
4. B. Grunbaum, Measures ofsymmetry for convex sets, Proceedings ofthe Symposia in Pure Mathematics, 1963, Symposium on Convexity, University ofWashington, 1961, pp. 233-270.
5. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
6. A.V. Kostochka, J. NeSsetSril, Coloring relatives ofintervals on the plane, I: chromatic number versus girth, European J. Combin. 19 (1998) 103-110.
7. A.V. Kostochka, I.G. Perepelitsa, Coloring intersection graphs ofboxes on the plane, Discrete Math. 220 (2000) 243-249.