A sufficient condition for the existence of plane spanning trees on geometric graphs
Combinatorics
2015-11-05 v1 Computational Geometry
Discrete Mathematics
Abstract
Let P be a set of n > 2 points in general position in the plane and let G be a geometric graph with vertex set P. If the number of empty triangles uvw in P for which the subgraph of G induced by {u,v,w} is not connected is at most n-3, then G contains a non-self intersecting spanning tree.
Keywords
Cite
@article{arxiv.1202.3385,
title = {A sufficient condition for the existence of plane spanning trees on geometric graphs},
author = {Eduardo Rivera-Campo and Virginia Urrutia-Galicia},
journal= {arXiv preprint arXiv:1202.3385},
year = {2015}
}
Comments
Accepted for publication in Computational Geometry: Theory and Applications