Buscar
Mostrando ítems 1-6 de 6
Artículo
On the connectivity and restricted edge-connectivity of 3-arc graphs
(Elsevier, 2014-01-10)
A 3 − arc of a graph G is a 4-tuple (y, a, b, x) of vertices such that both (y, a, b) and (a, b, x) are paths of length two in G. Let ←→G denote the symmetric digraph of a graph G. The 3-arc graph X(G) of a given graph ...
Artículo
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 ...
Artículo
On average connectivity of the strong product of graphs
(Elsevier, 2013)
The average connectivity κ(G) of a graph G is the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. The connectivity κ(G) can be seen as the minimum, over ...
Artículo
The Menger number of the strong product of graphs
(Elsevier, 2013)
The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected graph G, denoted by ζℓ(x, y), is the maximum number of internally disjoint xy-paths whose lengths are at most ℓ in G. The ...
Ponencia
On some partitioning problems for two-colored point sets
(Prensas de la Universidad de Zaragoza, 2009)
Let S be a two-colored set of n points in general position in the plane. We show that S admits at least 2 n 17 pairwise disjoint monochromatic triangles with vertices in S and empty of points of S. We further show ...
Artículo
Regional variations in entrepreneurial cognitions: Start-up intentions of university students in Spain
(Taylor & Francis, 2011)
Empirical research has recently paid considerable attention to the role of environmental factors in explaining regional variations in entrepreneurial activity. However, cognitive models have not usually included these ...