Buscar
Mostrando ítems 1-3 de 3
Artículo
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
(2014)
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: ...
Artículo
Monochromatic geometric k-factors in red-blue sets with white and Steiner points
(2009)
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 ...
Artículo
New results on the robust coloring problem
(Springer, 2024-03-23)
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This ...