The center of an infinite graph. - Luis Boza; Ana Diánez; Alberto Márquez 001 (Discret. Math., 1996)

The Size of a Graph Without Topological Complete Subgraphs. - Martín Cera; Ana Diánez; Alberto Márquez 001 (SIAM J. Discret. Math., 2000)

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)

Extremal Graphs without Topological Complete Subgraphs. - Martín Cera; Ana Diánez; Alberto Márquez 001 (SIAM J. 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 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)

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)

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

Size of Graphs with High Girth. - Encarnación Abajo; Ana Diánez (Electron. Notes Discret. Math., 2007)

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)

New families of graphs without short cycles and large size. - Encarnación Abajo; Camino Balbuena; Ana Diánez (Discret. Appl. Math., 2010)

Exact values of ex(nu;{C3, C4, ..., Cn}). - Encarnación Abajo; Ana Diánez (Discret. Appl. Math., 2010)

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

Graphs with maximum size and lower bounded girth. - Encarnación Abajo; Ana Diánez (Appl. Math. Lett., 2012)

Girth of {C3, ..., Cs}-free extremal graphs. - Encarnación Abajo; Camino Balbuena; Ana Diánez (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)

Exact value of ex(n;{c3, ..., cs}) for n ≤ [25(s-1)/8]. - Encarnación Abajo; Ana Diánez (Discret. Appl. Math., 2015)