Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874277 | Information Processing Letters | 2014 | 12 Pages |
Abstract
Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We consider the problem of finding such a k-factor of S by using auxiliary points. Two types are considered: white points whose position is fixed, and Steiner points which have no fixed position. Our approach provides algorithms for constructing those k-factors, and gives bounds on the number of auxiliary points needed to draw a monochromatic geometric planar k-factor of S.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
D. Garijo, M.A. Garrido, C.I. Grima, A. Márquez, A. Moreno-González, J.R. Portillo, P. Reyes, R. Robles, J. Valenzuela,