A note on the existence of plane spanning trees of geometric graphs

摘要

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.