M. Abellanas, J. Garcia, G. Hernández, M. Noy, and P. Ramos, Bipartite embeddings of trees in the plane, Discrete Applied Mathematics, pp.93-141, 1999.

O. Aichholzer, S. Cabello, R. Fabila-monroy, D. Flores-peñaloza, T. Hackl et al., Wood: Edge-removal and non-crossing configurations in geometric graphs, Proc. 24th European Workshop on Computational Geometry, pp.119-122, 2008.

N. Alon, S. Rajagopalan, and S. Suri, Long non-crossing configurations in the plane, Proceedings of the ninth annual symposium on Computational geometry , SCG '93, pp.385-394, 1993.
DOI : 10.1145/160985.161145

M. Bern, D. Eppstein, B. Cern´ycern´y, Z. Dvo´rákdvo´rák, V. Jelínek et al., Approximation algorithms for geometric problems, in Approximation Algorithms Noncrossing Hamiltonian paths in geometric graphs, PWS, pp.296-345, 1997.

T. K. Dey, Improved Bounds for Planar k -Sets and Related Problems, Discrete & Computational Geometry, vol.19, issue.3, pp.373-382, 1998.
DOI : 10.1007/PL00009354

H. Edelsbrunner, Algorithms in Combinatorial Geometry, 1987.
DOI : 10.1007/978-3-642-61568-9

D. Eppstein, Spanning Trees and Spanners, Handbook of Computational Geometry, pp.425-461, 2000.
DOI : 10.1016/B978-044482537-7/50010-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.7071

S. P. Fekete, Simplicity and hardness of the maximum traveling salesman problem under geometric distances, Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp.337-345, 1999.

F. Hurtado, M. Kano, D. Rappaport, and C. D. , Encompassing colored planar straight line graphs, Computational Geometry, vol.39, issue.1, pp.14-23, 2008.
DOI : 10.1016/j.comgeo.2007.05.006
URL : http://doi.org/10.1016/j.comgeo.2007.05.006

G. Károlyi, J. Pach, and G. Tóth, Ramsey-Type Results for Geometric Graphs, I, Discrete & Computational Geometry, vol.18, issue.3, pp.247-255, 1997.
DOI : 10.1007/PL00009317

G. Károlyi, J. Pach, G. Tóth, and P. Valtr, Ramsey-type results for geometric graphs. II, Discrete and Computational Geometry, pp.375-388, 1998.

L. Lovász, On the number of halving lines, Ann. Univ. Sci. Budapest, Eötvös, Sec. Math, vol.14, pp.107-108, 1971.

J. S. Mitchell, Geometric shortest paths and network optimization, in Handbook of Computational Geometry, pp.633-701, 2000.

F. Preparata and M. Shamos, Computational Geometry: An Introduction, 1985.
DOI : 10.1007/978-1-4612-1098-6