A sufficient condition for the existence of plane spanning trees on geometric graphs
نویسندگان
چکیده
Let P be a set of n ≥ 3 points in general position in the plane and let G be a geometric graph with vertex set P . If the number of empty triangles 4uvw 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.
منابع مشابه
Packing Plane Spanning Double Stars into Complete Geometric Graphs
Consider the following problem: Given a complete geometric graph, how many plane spanning trees can be packed into its edge set? We investigate this question for plane spanning double stars instead of general spanning trees. We give a necessary, as well as a sufficient condition for the existence of packings with a given number of plane spanning double stars. We also construct complete geometri...
متن کاملPartitions of Complete Geometric Graphs into Plane Trees
Consider the following open problem: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directions. First, we study the case of convex geometric graphs. It is well known that the complete convex graph K2n has a partition into n plane spanning trees. We characterise all such partitions. Second, we give a suffi...
متن کامل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.
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 46 شماره
صفحات -
تاریخ انتشار 2013