2000 character limit reached
A sufficient condition for the existence of plane spanning trees on geometric graphs
Published 15 Feb 2012 in math.CO, cs.CG, and cs.DM | (1202.3385v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.