1 research outputs found

    Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets

    Full text link
    Let RR and BB be a set of red points and a set of blue points in the plane, respectively, such that RβˆͺBR\cup B is in general position, and let f:Rβ†’{2,3,4,…}f:R \to \{2,3,4, \ldots \} be a function. We show that if 2β‰€βˆ£Bβˆ£β‰€βˆ‘x∈R(f(x)βˆ’2)+22\le |B|\le \sum_{x\in R}(f(x)-2) + 2, then there exists a non-crossing geometric spanning tree TT on RβˆͺBR\cup B such that 2≀deg⁑T(x)≀f(x)2\le \operatorname{deg}_T(x)\le f(x) for every x∈Rx\in R and the set of leaves of TT is BB, where every edge of TT is a straight-line segment.Comment: 6 pages, 2 figure
    corecore