Search
Now showing items 1-10 of 33
Article
Classical properties of algebras using a new graph association
(Cornell University, 2017)
We study the relation between algebraic structures and Graph Theory. We have de ned ve di erent weighted digraphs associated to a nite dimensional algebra over a eld in order to tackle important properties of the ...
Presentation
Witness-Bar Visibility Graphs
(Instituto de Matemáticas de la UNAM, 2013)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted ...
Presentation
Técnicas cuánticas para la evolución de grafos aleatorios
(Instituto de Matemáticas de la UNAM, 2015)
Con la idea de modelar el comportamiento de diversas redes sociales a lo largo del tiempo, mostramos algunos resultados preliminares sobre evolución de grafos aleatorias empleando técnicas inspiradas en la mecánica ...
Article
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: ...
Article
A sufficient degree condition for a graph to contain all trees of size k
(Springer, 2011)
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...
Article
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 ...
Presentation
Witness bar visibility
(2013)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted ...
Article
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 ...
Article
There are simple and robust refinements (almost) as good as Delaunay
(2014)
A new edge-based partition for triangle meshes is presented, the Seven Triangle Quasi-Delaunay partition (7T-QD). The proposed partition joins together ideas of the Seven Triangle Longest-Edge partition (7T-LE), and the ...
Article
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 ...