1. M. Abellanas, A. García, F. Hurtado, J. Tejel, and J. Urrutia. Augmenting the connectivity of geometric graphs. Comput. Geom., to appear. Preliminary version: Aumentando la conectividad de grafos geométricos. Proc. XI Encuentros de Geometría Computacional, pp. 149–156. Santander, 2005
2. N. Benbernou, E.D. Demaine, M.L. Demaine, M. Hoffmann, M. Ishaque, D. Souvaine, and C. Tóth. Disjoint segments have convex partitions with 2-edge connected dual graphs. In Proc. 19th Canadian Conf. on Computational Geometry (CCCG'07), pp. 13–16. Carleton University, 2007
3. An orientation theorem with parity conditions;Frank;Discrete Appl. Math.,2001
4. Graphs of triangulations and perfect matchings;Houle;Graphs Combin.,2005