Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets
Discrete Mathematics
2018-12-10 v1 Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.1812.02866,
title = {Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets},
author = {Mikio Kano and Kenta Noguchi and David Orden},
journal= {arXiv preprint arXiv:1812.02866},
year = {2018}
}
Comments
6 pages, 2 figures