Topics on line segments and polygons Original Research Article

Let S be a set of pairwise disjoint line segments in the plane. Consider the figure F (polygon, tree or path) whose every edge goes through endpoints of elements in S as many as possible, where F does not intersect itself and any element of S. We construct some figures under the preceding conditions.