Buscar
Mostrando ítems 41-50 de 66
Artículo
Hexagonal Tilings and Locally C6 Graphs
(Cornell University, 2005)
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural embedding in the torus or in the Klein bottle (see [12]). We also show that locally grid graphs, ...
Artículo
On the connectivity of skeletons of pseudomanifolds with boundary
(Mathematical Institute, Academy of Sciences of the Czech Republic, 2002)
In this note we show that 1-skeletons and 2-skeletons of n-pseudomanifolds with full boundary are (n+ 1)-connected graphs and n-connected 2-complexes, respectively. This generalizes previous results due to Barnette and Woon.
Artículo
Resolving sets for Johnson and Kneser graphs
(2013)
A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, there exists x∈Sx∈S such that the distances d(u,x)≠d(v,x)d(u,x)≠d(v,x). In this paper, we consider the Johnson graphs J(n,k)J(n,k) ...
Artículo
Towards a new framework for domination
(2011)
Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding different mathematical frameworks where domination notions naturally arise, providing new points ...
Artículo
Reporting Bichromatic Segment Intersections from Point Sets
(2012)
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red ...
Artículo
Shortcut sets for plane Euclidean networks (Extended abstract)
(Elsevier, 2016)
We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of segments, called shortcut set, while reducing the diameter of the locus of the resulting network. ...
Artículo
Transforming Triangulations on Nonplanar Surfaces
(2010)
We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some ...
Artículo
On the connectivity of infinite graphs and 2-complexes
(Elsevier, 1999)
This paper contains a study of the connectivity of infinite graphs and 2-complexes. Various connectivity types are defined and relationships among them are given. In addition new Menger-Whitney type theorems are stated for ...
Artículo
Diagonal flips in outer-triangulations on closed surfaces
(2002)
We show that any two outer-triangulations on the same closed surface can be transformed into each other by a sequence of diagonal flips, up to isotopy, if they have a sufficiently large and equal number of vertices.
Artículo
Hexagonal Tilings: Tutte Uniqueness
(Cornell University, 2005)
We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined by their Tutte polynomial, showing as an example how to apply this technique to the toroidal hexagonal tiling.