Structure of the Extremal Family ex(n;tkp). - Martín Cera; Ana Diánez; Pedro García-Vázquez (Electron. Notes Discret. Math., 2001)

Complete bipartite free graphs. - Martín Cera; Ana Diánez; Pedro García-Vázquez; Juan Carlos Valenzuela (Ars Comb., 2003)

Minor clique free extremal graphs. - Martín Cera; Ana Diánez; Pedro García-Vázquez; Juan Carlos Valenzuela (Ars Comb., 2004)

Edge-connectivity in Pk-path graphs. - Camino Balbuena; Pedro García-Vázquez (Discret. Math., 2004)

Sufficient conditions for lambda'-optimality of graphs with small conditional diameter. - Camino Balbuena; Martín Cera; Ana Diánez; Pedro García-Vázquez; Xavier Marcote (Inf. Process. Lett., 2005)

On restricted connectivities of permutation graphs. - Camino Balbuena; Xavier Marcote; Pedro García-Vázquez (Networks, 2005)

On the order of bi-regular cages of even girth. - Camino Balbuena; Gabriela Araujo-Pardo; Pedro García-Vázquez; Xavier Marcote; Juan Carlos Valenzuela (Electron. Notes Discret. Math., 2006)

Highly connected star product graphs. - Xavier Marcote; Camino Balbuena; Pedro García-Vázquez; Juan Carlos Valenzuela (Electron. Notes Discret. Math., 2006)

Extremal K(s, t)-free bipartite graphs. - Juan Carlos Valenzuela; Camino Balbuena; Pedro García-Vázquez; Xavier Marcote (Electron. Notes Discret. Math., 2006)

Sufficient conditions for lambda'-optimality in graphs with girth g. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote (J. Graph Theory, 2006)

Reliability of interconnection networks modeled by a product of graphs. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote (Networks, 2006)

Trees having an even or quasi even degree sequence are graceful. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote; Juan Carlos Valenzuela (Appl. Math. Lett., 2007)

Extremal bipartite graphs with high girth. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote; Juan Carlos Valenzuela (Ars Comb., 2007)

On the edge-connectivity and restricted edge-connectivity of a product of graphs. - Camino Balbuena; Martín Cera; Ana Diánez; Pedro García-Vázquez; Xavier Marcote (Discret. Appl. Math., 2007)

Edge-connectivity and edge-superconnectivity in sequence graphs. - Camino Balbuena; Josep Fàbrega; Pedro García-Vázquez (Discret. Appl. Math., 2007)

A sufficient condition for Pk-path graphs being r-connected. - Camino Balbuena; Pedro García-Vázquez (Discret. Appl. Math., 2007)

New exact values of the maximum size of graphs free of topological complete subgraphs. - Camino Balbuena; Martín Cera; Ana Diánez; Pedro García-Vázquez (Discret. Math., 2007)

Connectivity of graphs with given girth pair. - Camino Balbuena; Martín Cera; Ana Diánez; Pedro García-Vázquez; Xavier Marcote (Discret. Math., 2007)

On the restricted connectivity and superconnectivity in graphs with given girth. - Camino Balbuena; Martín Cera; Ana Diánez; Pedro García-Vázquez; Xavier Marcote (Discret. Math., 2007)

Counterexample to a conjecture of Györi on C2l-free bipartite graphs. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote; Juan Carlos Valenzuela (Discret. Math., 2007)

New results on the Zarankiewicz problem. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote; Juan Carlos Valenzuela (Discret. Math., 2007)

Graphs without minor complete subgraphs. - Martín Cera; Ana Diánez; Pedro García-Vázquez; Juan Carlos Valenzuela (Discret. Math., 2007)

On the Minimum Order of Extremal Graphs to have a Prescribed Girth. - Camino Balbuena; Pedro García-Vázquez (SIAM J. Discret. Math., 2007)

On the order of ({r, m};g)-cages of even girth. - Gabriela Araujo-Pardo; Camino Balbuena; Pedro García-Vázquez; Xavier Marcote; Juan Carlos Valenzuela (Discret. Math., 2008)

On the girth of extremal graphs without shortest cycles. - Camino Balbuena; Martín Cera; Ana Diánez; Pedro García-Vázquez (Discret. Math., 2008)

Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. - Camino Balbuena; Martín Cera; Ana Diánez; Pedro García-Vázquez; Xavier Marcote (Discret. Math., 2008)

Connectivity measures in matched sum graphs. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote (Discret. Math., 2008)

Extremal K(s, t)-free Bipartite Graphs. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote; Juan Carlos Valenzuela (Discret. Math. Theor. Comput. Sci., 2008)

Conditional diameter saturated graphs. - Camino Balbuena; Pedro García-Vázquez; Xavier Marcote; Juan Carlos Valenzuela (Networks, 2008)

Edge fault tolerance analysis of super k-restricted connected networks. - Camino Balbuena; Pedro García-Vázquez (Appl. Math. Comput., 2010)

On the Ramsey numbers for stars versus complete graphs. - Luis Boza; Martín Cera; Pedro García-Vázquez; M. P. Revuelta (Eur. J. Comb., 2010)

On the λ′-optimality in graphs with odd girth g and even girth h. - Camino Balbuena; Pedro García-Vázquez; Luis Pedro Montejano 001; Julián Salas (Appl. Math. Lett., 2011)

Superconnectivity of graphs with odd girth g and even girth h. - Camino Balbuena; Pedro García-Vázquez; Luis Pedro Montejano 001 (Discret. Appl. Math., 2011)

Toughness of the corona of two graphs. - Rocío M. Casablanca; Ana Diánez; Pedro García-Vázquez (Int. J. Comput. Math., 2011)

Restricted arc-connectivity of generalized p-cycles. - Camino Balbuena; Pedro García-Vázquez; Adriana Hansberg; Luis Pedro Montejano 001 (Discret. Appl. Math., 2012)

On average connectivity of the strong product of graphs. - Encarnación Abajo; Rocío M. Casablanca; Ana Diánez; Pedro García-Vázquez (Discret. Appl. Math., 2013)

The Menger number of the strong product of graphs. - Encarnación Abajo; Rocío M. Casablanca; Ana Diánez; Pedro García-Vázquez (Discret. Math., 2013)

On the super-restricted arc-connectivity of s -geodetic digraphs. - Camino Balbuena; Pedro García-Vázquez; Adriana Hansberg; Luis Pedro Montejano 001 (Networks, 2013)

On the connectivity and restricted edge-connectivity of 3-arc graphs. - Camino Balbuena; Pedro García-Vázquez; Luis Pedro Montejano 001 (Discret. Appl. Math., 2014)

On the bipartite vertex frustration of graphs. - Pedro García-Vázquez (Electron. Notes Discret. Math., 2016)