Abstract
If G is a geometric graph with n ≥ 5 vertices and for any set U with 5 vertices of G, the geometric subgraph of G, induced by U, has a plane spanning tree, then G has a plane spanning tree.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Károlyi, G., Pach, J., Tóth, G.: Ramsey-type Results for Geometric Graphs I. In: ACM Symposium on Computational Geometry, Philadelphia, PA (1996); Discrete Comput. Geom. 18(3), 247–255 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rivera-Campo, E. (2000). A Note on the Existente of Plane Spanning Trees of Geometrie Graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-46515-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67181-7
Online ISBN: 978-3-540-46515-7
eBook Packages: Springer Book Archive