Buscar
Mostrando ítems 1-10 de 21
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
Stabbers of line segments in the plane
(2011)
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges ...
Artículo
Resolving sets for breaking symmetries of graphs
(Cornell University, 2014)
This paper deals with the maximum value of the difference between the determining number and the metric dimension of a graph as a function of its order. Our technique requires to use locating-dominating sets, and perform ...
Artículo
Tutte uniqueness of locally grid graphs
(Departamento de Matemáticas CINVESTAV, 2004)
A graph is said to be locally grid if the structure around each of its vertices is a 3 × 3 grid. As a follow up of the research initiated in [4] and [3] we prove that most locally grid graphs are uniquely determined by ...
Artículo
On the metric dimension, the upper dimension and the resolving number of graphs
(2013)
This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We first answer a question raised by Chartrand and Zhang asking for a characterization of the graphs ...
Artículo
The resolving number of a graph
(2013)
We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by Chartrand, Poisson and Zhang. First, we establish an important difference between the two parameters: ...
Artículo
Artículo
The determining number of Kneser graphs
(2013)
A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G is the minimum cardinality of a determining set of G. This paper studies ...
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 ...