1. P. K. Agarwal, B. Aronov, J. Pach, R. Pollack, and M. Sharir, Quasi-planar graphs have a linear number of edges,Proc. Graph Drawing '95, Passau (F. J. Brandenburg, ed.), Lecture Notes in Computer Science, Vol. 1207, Springer-Verlag, Berlin, 1996, pp. 1–7.
2. N. Alon and P. Erdós, Disjoint edges in geometric graphs,Discrete Comput. Geom.,4 (1989), 287–290.
3. N. Alon and J. Spencer,The Probabilistic Method, Wiley, New York, 1992.
4. B. Aronov, R. Seidel, and D. Souvaine, On compatible triangulations of simple polygons,Comput. Geom. Theory Appl.,3 (1993), 27–36.
5. S. Avital and H. Hanani, Graphs,Gilyonot Lematematika,3 (1966), 2–8 (in Hebrew).