Abstract
A graph whose vertex set is a set P of points in the plane and whose edges are line segments joining pairs of elements of P is called a geometric graph. In this paper we survey several results on geometric graphs on colored point sets. Of particular interest are bicolored point sets \(P= R \cup B\) in which the elements of P can considered to be colored red or blue. We will pay particular attention to perfect matchings, spanning trees and paths whose vertex sets are colored point sets. In the last section of this paper we give some results on point sets whose elements are labelled with the integers \(\{1, \ldots , n\}\) such that different elements of P receive different labels.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
