P. Bose and F. Hurtado, Flips in planar graphs, Computational Geometry, vol.42, issue.1, pp.60-80, 2009.
DOI : 10.1016/j.comgeo.2008.04.001

P. Bose, F. Hurtado, E. Rivera-campo, and D. R. Wood, Partitions of complete geometric graphs into plane trees, Computational Geometry, vol.34, issue.2, pp.116-125, 2006.
DOI : 10.1016/j.comgeo.2005.08.006

R. L. Brooks, On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, vol.37, issue.02, pp.194-197, 1941.
DOI : 10.1017/S030500410002168X

R. Cummins, Hamilton Circuits in Tree Graphs, IEEE Transactions on Circuit Theory, vol.13, issue.1, pp.82-90, 1966.
DOI : 10.1109/TCT.1966.1082546

V. Estivill-castro, M. Noy, and J. Urrutia, On the chromatic number of tree graphs, Discrete Mathematics, vol.223, issue.1-3, pp.363-366, 2000.
DOI : 10.1016/S0012-365X(00)00092-3

W. Goddard and H. C. Swart, Distances between graphs under edge operations, Discrete Mathematics, vol.161, issue.1-3, pp.121-132, 1996.
DOI : 10.1016/0012-365X(95)00073-6

P. Hell and J. Ne?et?il, Graphs and homomorphisms, 2004.
DOI : 10.1093/acprof:oso/9780198528173.001.0001

C. Hernando, F. Hurtado, and M. Noy, Graphs of Non-Crossing Perfect Matchings, Graphs and Combinatorics, vol.18, issue.3, pp.517-532, 2002.
DOI : 10.1007/s003730200038

M. Houle, F. Hurtado, M. Noy, and E. Rivera-campo, Graphs of Triangulations and Perfect Matchings, Graphs and Combinatorics, vol.21, issue.3, pp.325-331, 2005.
DOI : 10.1007/s00373-005-0615-2

F. Hurtado and M. Noy, Graph of triangulations of a convex polygon and tree of triangulations, Computational Geometry, vol.13, issue.3, pp.179-188, 1999.
DOI : 10.1016/S0925-7721(99)00016-4

C. Lee, The Associahedron and Triangulations of the n-gon, European Journal of Combinatorics, vol.10, issue.6, pp.551-560, 1989.
DOI : 10.1016/S0195-6698(89)80072-1

J. M. Lucas, The rotation graph of binary trees is Hamiltonian, Journal of Algorithms, vol.8, issue.4, pp.503-535, 1987.
DOI : 10.1016/0196-6774(87)90048-4

M. Molloy and B. Reed, Graph colouring and the probabilistic method, Algorithms and Combinatorics, vol.23, 2002.
DOI : 10.1007/978-3-642-04016-0

E. Rivera-campo and V. Urrutia-galicia, Hamilton cycles in the path graph of a set of points in convex position, Computational Geometry, vol.18, issue.2, pp.65-72, 2001.
DOI : 10.1016/S0925-7721(00)00026-2

D. Sleator, R. Tarjan, and W. Thurston, Rotation distance, triangulations, and hyperbolic geometry, Proceedings of the eighteenth annual ACM symposium on Theory of computing , STOC '86, pp.667-682, 1988.
DOI : 10.1145/12130.12143

V. Urrutia-galicia, Algunas propiedades de gráficas geométricas, 2000.