On the chromatic number of intersection graphs of convex sets in the plane

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages 1-12

  Kim, Seog Jin ^a   Kostochka, Alexandr ^a,b   Nakprasit, Kittikorn ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4644335787     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1805     Document Type: Article

References (18)

1. P.K. Agarwal and J. Pach, Combinatorial Geometry, John Wiley & Sons. Inc., 1995.
2. J. Akiyama, K. Hosono, and M. Urabe, Some combinatorial problems, Discrete Math. 116 (1993) 291-298.
3. E. Asplund and B. Grünbaum, On a coloring problem, Math. Scand. 8 (1996) 181-188.
4. B. N. Clark, C. J. Colbourn, and D. S. Johnson, Unit disk graphs, Discrete Math. 86 (1990), 165-177.
5. M. Golumbic, Algorithmic graph theory and perfect graphs. Academic Press, 1980.
6. A. Gräf, M. Stumpf, and G. Weißenfels, On Coloring Unit Disk Graphs, Algorithmica 20 (1998) 277-293.
7. B. Grünbaum, On a Conjecture of H. Hadwiger, Bull. Res. Counc. of Israel, 7F (1957), 215-219.
8. B. Grünbaum, Borsuk's Partition Conjecture in Minkowski Planes, Bull. Res. Counc. of Israel, 7F, (1957), 25-30.
9. A. Gyárfás, Problems from the world surrounding perfect graphs. Proceedings of the International Conference on Combinatorial Analysis and its Applications (Pokrzywna, 1985). Zastos. Mat. 19 (1987), 413-441 (1988).
10. A. Gyárfás, On the chromatic number of multiple interval graphs and overlap graphs, Discrete Math. 55 (1985), 161-166.
11. A. Gyárfás, J. Lehel, Covering and coloring problems for relatives of intervals, Discrete Math. 55 (1985), 167-180.
12. H. Hadwiger and H. Debrunner, Combinatorial geometry in the plane, Holt, Rinehart and Winston, New York, 1964.
13. A. Kostochka, On upper bounds on the chromatic numbers of graphs, Transactions of the Institute of Mathematics (Siberian Branch of the Academy of Sciences of USSR), 10 (1988), 204-226 (in Russian).
14. A.V. Kostochka and I.G. Perepelitsa, Coloring intersection graphs of boxes on the plane, Discrete Math. 220 (2000) 243-249.
15. D. Larman, J. Matousek, J. Pach, and J. Torocsik, A Ramsey-Type Result for Convex Sets, Bull. London Math. Soc. 26 (1994) 132-136.
16. H. Minkowski, Dichteste gitterformige Lagerung kongruenter Körper, Nachr. der K. es. der Wiss. zu Göttingen, Math. Phys. Kl., (1904), 311-355.
17. R. Peeters, On coloring j-unit sphere graphs, FEW 512, Department of Economics, Tilburg University, 1991.
18. I.G. Perepelitsa, Bounds on the chromatic number of intersection graphs of sets in the plane, Discrete Math., 262 (2003) 221-227.