Hernando, María del CarmenHurtado, FerránMárquez Pérez, AlbertoMora, MercéNoy, Marc2016-02-022016-02-021999http://hdl.handle.net/11441/33840Given a set P of points in the plane, the geometric tree graph of P is defined as the graph T(P) whose vertices are non-crossing spanning with straight edges trees of P, and where two trees T1 and T2 are adjacent if T2 = T1 − e + f for some edges e and f. In this paper we concentrate on the geometric tree graph of a set of n points in convex position, denoted by Gn. We prove several results about Gn, among them the existence of Hamiltonian cycles and the fact that they have maximum connectivity.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/ doi:10.1016/S0166-218X(99)00006-2