Monochromatic geometric k-factors in red-blue sets with white and Steiner points
We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible to find a k-factor we make use of auxiliary points: white points, whose position is given as a datum and which color is free; and Steiner points whose position and color is free...
| Autores: | , , , , , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/34688 |
| Acceso en línea: | http://hdl.handle.net/11441/34688 https://doi.org/10.1016/j.endm.2009.07.025 |
| Access Level: | acceso abierto |
| Palabra clave: | k-factor perfect matching red-blue sets white points Steiner points |
| Sumario: | We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible to find a k-factor we make use of auxiliary points: white points, whose position is given as a datum and which color is free; and Steiner points whose position and color is free. We present bounds on the number of white and/or Steiner points necessary and/or sufficient to draw a monochromatic planar geometric k-factor. |
|---|