• Artículo
      Icon

      A sufficient degree condition for a graph to contain all trees of size k 

      Balbuena, Camino; Márquez Pérez, Alberto; Portillo Fernández, José Ramón (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 ...
    • Artículo
      Icon

      On average connectivity of the strong product of graphs 

      Abajo Casado, María Encarnación; Moreno Casablanca, Rocío; Diánez Martínez, Ana Rosa; García Vázquez, Pedro (Elsevier, 2013)
      The average connectivity κ(G) of a graph G is the average, over all pairs of vertices, of the maximum number of internally ...
    • Artículo
      Icon

      On the connectivity and restricted edge-connectivity of 3-arc graphs 

      Balbuena, Camino; García Vázquez, Pedro; Montejano Cantoral, Luis Pedro (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 ...
    • Artículo
      Icon

      The Menger number of the strong product of graphs 

      Abajo Casado, María Encarnación; Moreno Casablanca, Rocío; Diánez Martínez, Ana Rosa; García Vázquez, Pedro (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 ...