Listar por autor 

Listar por autor "Balbuena, Camino"  

Mostrando ítems 1-4 de 4

    • 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

      Extremal K-(s,K-t)-free bipartite graphs 

      Balbuena, Camino; García Vázquez, Pedro; Marcote Ordax, Xavier; Valenzuela Tripodoro, Juan Carlos (Association DMTCS, 2008)
      In this paper new exact values of the Zarankiewicz function z(m, n; s, t) are obtained assuming certain requirements on ...
    • 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

      Topological minors in bipartite graphs 

      Balbuena, Camino; Cera López, Martín; García Vázquez, Pedro; Valenzuela, Juan Carlos (Springer, 2011-10-15)
      For a bipartite graph G on m and n vertices, respectively, in its vertices classes, and for integers s and t such that 2 ...