G. Araujo, A. Dumitrescu, F. Hurtado, M. Noy, and J. Urrutia, On the chromatic number of some geometric type Kneser graphs, Computational Geometry, vol.32, issue.1, pp.59-69, 2005.
DOI : 10.1016/j.comgeo.2004.10.003

I. Bárány and Z. Füredi, Empty simplices in Euclidean space, Bulletin canadien de math??matiques, vol.30, issue.4, pp.436-445, 1987.
DOI : 10.4153/CMB-1987-064-1

I. Bárány and G. Károlyi, Problems and results around the Erd? os-Szekeres convex polygon theorem, Revised Papers from the Japanese Conference on Discrete and Computational Geometry, JCDCG '00, pp.91-105, 2001.

I. Bárány and P. Valtr, Planar point sets with a small number of empty convex polygons, Studia Scientiarum Mathematicarum Hungarica, vol.41, issue.2, pp.243-266, 2004.
DOI : 10.1556/SScMath.41.2004.2.4

C. Bautista-santiago, J. Cano, R. Fabila-monroy, D. Flores-peñaloza, H. González-aguilar et al., On the diameter of a Geometric Johnson type graph, Proceedings of the 26th European Workshop on Computational Geometry, pp.61-64, 2010.

T. Denley, The Odd Girth of the Generalised Kneser Graph, European Journal of Combinatorics, vol.18, issue.6, pp.607-611, 1997.
DOI : 10.1006/eujc.1996.0122

A. Dumitrescu, Planar sets with few empty convex polygons, Studia Scientiarum Mathematicarum Hungarica, vol.36, issue.1-2, pp.93-109, 2000.
DOI : 10.1556/SScMath.36.2000.1-2.9

T. Etzion, On the Nonexistence of Perfect Codes in the Johnson Scheme, SIAM Journal on Discrete Mathematics, vol.9, issue.2, pp.201-209, 1996.
DOI : 10.1137/S0895480194275692

R. Fabila-monroy and C. Huemer, Covering Islands in Plane Point Sets, Proc. XIV Encuentros de Geometría Computacional ECG2011, pp.213-216, 2011.
DOI : 10.1007/s00373-007-0717-0

C. Godsil and G. Royle, Algebraic Graph Theory, 2001.
DOI : 10.1007/978-1-4613-0163-9

J. D. Horton, Sets with no empty convex $7$-gons, Bulletin canadien de math??matiques, vol.26, issue.4, pp.482-484, 1983.
DOI : 10.4153/CMB-1983-077-8

M. Katchalski and A. Meir, On empty triangles determined by points in the plane, Acta Mathematica Hungarica, vol.26, issue.3-4, pp.323-328, 1988.
DOI : 10.1007/BF01903339

J. Matou?ek, Lectures on Discrete Geometry, 2002.
DOI : 10.1007/978-1-4613-0039-7

F. Muga, J. Caro, H. Adorna, and G. Baes, On the wide-diameter of the Johnson graph J(n, k) The Loyola Schools Review, pp.78-88, 2001.

P. Valtr, On the minimum number of empty polygons in planar point sets, Studia Scientiarum Mathematicarum Hungarica, vol.30, pp.155-163, 1995.