1 research outputs found
Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets
Let and be a set of red points and a set of blue points in the plane,
respectively, such that is in general position, and let be a function. We show that if , then there exists a non-crossing geometric spanning tree
on such that for every and the set of leaves of is , where every edge of is a
straight-line segment.Comment: 6 pages, 2 figure