Presentation
Triangulations without pointed spanning trees
Author/s | Aichholzer, Oswin
Huemer, Clemens Krasser, Hannes |
Date | 2004 |
Published in |
|
Abstract | 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. |
Project ID. | 1/2003
![]() |
Citation | Aichholzer, O., Huemer, C. y Krasser, H. (2004). Triangulations without pointed spanning trees. En 20th European Workshop on Computational Geometry, Sevilla. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Triangulations without pointed ... | 98.41Kb | ![]() | View/ | |