A sufficient condition for the existence of plane spanning trees on geometric graphs

Details A sufficient condition for the existence of plane spanning trees on geometric graphs A sufficient condition for the existence of plane spanning trees on geometric graphs

2012-02-15

arxiv.org/abs/1202.3385v1

Mathematics

Combinatorics

Accepted for publication in Computational Geometry: Theory and Applications

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A sufficient condition for the existence of plane spanning trees on geometric graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A sufficient condition for the existence of plane spanning trees on geometric graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sufficient condition for the existence of plane spanning trees on geometric graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558224