1. G. Araujo, A. Dumitrescu, F. Hurtado, M. Noy, J. Urrutia, On the chromatic number of some geometric Kneser graphs. Comput. Geom. Theor. Appl. 32, 59–69 (2005)
2. A. Bialostocki, P. Dierker, W. Voxman, Either a graph or its complement is connected: A continuing saga. Manuscript (2001)
3. J.A. Bondy, P. Erdős, Ramsey numbers for cycles in graphs. J. Combin. Theor. B 14, 46–54 (1973)
4. A. Bialostocki, H. Harborth, Ramsey colorings for diagonals of convex polygons. Abh. Braunschweig. Wiss. Ges. 47, 159–163 (1996)
5. P. Brass, Gy. Károlyi, P. Valtr, in A Turán-type Extremal Theory of Convex Geometric Graphs, ed. by B. Aronov et al. Discrete and Computational Geometry. Algorithms and Combinatorics, vol. 25 (Springer, Berlin, 2003), pp. 275–300