Ponencia
Triangulations without pointed spanning trees
Autor/es | Aichholzer, Oswin
Huemer, Clemens Krasser, Hannes |
Fecha de publicación | 2004 |
Fecha de depósito | 2017-03-20 |
Publicado en |
|
Resumen | Problem 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 ... Problem 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. |
Identificador del proyecto | 1/2003 |
Cita | Aichholzer, O., Huemer, C. y Krasser, H. (2004). Triangulations without pointed spanning trees. En 20th European Workshop on Computational Geometry, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Triangulations without pointed ... | 98.41Kb | [PDF] | Ver/ | |