Buscar
Mostrando ítems 1-10 de 26
Tesis Doctoral
El tamaño de un grafo sin subgrafos homeomorfos a un grafo completo
(1998)
"Desde el origen de la Teoría de Grafos Extremales, uno de los problemas más generales que pueden plantearse en este campo, es estudiar los grafos de manera que podamos encontrar condiciones para que contengan o no a un ...
Ponencia
Anchura de un convexo en la esfera.
(1997-01)
Se generaliza el concepto de anchura de un conjunto en el plano a la superficie de la esfera, dando condiciones necesarias y suficientes para que un conjunto convexo sobre la superficie de la esfera puede pasar a través ...
Artículo
On Sedlacek's C-Graphs
(Societatea de Științe Matematice din România, 1993)
In this Note, we study some properties of Sedlacek's C-graphs (see [3], [4] and [5]). In particular, we give new methods to build infinite families of C-graphs starting by a C-graph, and we study the relationship between ...
Artículo
Triangle-Free Planar Graphs as Segments Intersection Graphs
(1999)
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and oblique) and in such a ...
Artículo
The center of an infinite graph
(1996)
In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give ...
Ponencia
Diameter of a set on the cylinder
(Queen's University, 1997)
Artículo
Geometric tree graphs of points in convex position
(1999)
Given a set P of points in the plane, the geometric tree graph of P is defined as the graph T(P) whose vertices are non-crossing spanning with straight edges trees of P, and where two trees T1 and T2 are adjacent if T2 = ...
Artículo
Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard
(1997)
This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model for those embeddings and we study the complexity of minimizing the number of bends. In particular, we ...
Artículo
Proper Homotopy Classification of Graphs
(London Mathematical Society, 1990)
This work presents a classification of the proper homotopy types of locally finite 1-dimensional CW-complexes.
Tesis Doctoral
Transversalidad en 2-complejos
(1996)
"Si bien el problema de la Transversalidad ha sido ampliamente estudiado en la Teoría de Grafos, los 2-complejos de Euler ha sido tratados, hasta el momento, dentro del marco de la Topología Algebraica. El objetivo central ...