Aichholzer, OswinHuemer, ClemensKrasser, Hannes2017-03-202017-03-202004Aichholzer, O., Huemer, C. y Krasser, H. (2004). Triangulations without pointed spanning trees. En 20th European Workshop on Computational Geometry, Sevilla.http://hdl.handle.net/11441/56020Problem 50 in the Open Problems Project asks whether any triangulation on a point set in the plane contains a pointed spanning tree as a subgraph. We provide a counterexample. As a consequence we show that there exist triangulations which require a linear number of edge flips to become Hamiltonian.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/TriangulationSpanning treePointed pseudo-triangulationHamiltonian cycleEdge flipinfo:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccess