Ana Diánez

Orcid: 0000-0003-1469-6726

According to our database1, Ana Diánez authored at least 23 papers between 1996 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
Exact value of ex(n;{c<sub>3</sub>, ..., c<sub>s</sub>}) for n ≤ [25(s-1)/8].
Discret. Appl. Math., 2015

2013
The Menger number of the strong product of graphs.
Discret. Math., 2013

On average connectivity of the strong product of graphs.
Discret. Appl. Math., 2013

2012
Girth of {C<sub>3</sub>, ..., C<sub>s</sub>}-free extremal graphs.
Discret. Appl. Math., 2012

Graphs with maximum size and lower bounded girth.
Appl. Math. Lett., 2012

2011
Toughness of the corona of two graphs.
Int. J. Comput. Math., 2011

2010
Exact values of ex(nu;{C<sub>3</sub>, C<sub>4</sub>, ..., C<sub>n</sub>}).
Discret. Appl. Math., 2010

New families of graphs without short cycles and large size.
Discret. Appl. Math., 2010

2008
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs.
Discret. Math., 2008

On the girth of extremal graphs without shortest cycles.
Discret. Math., 2008

2007
Size of Graphs with High Girth.
Electron. Notes Discret. Math., 2007

Graphs without minor complete subgraphs.
Discret. Math., 2007

On the restricted connectivity and superconnectivity in graphs with given girth.
Discret. Math., 2007

Connectivity of graphs with given girth pair.
Discret. Math., 2007

New exact values of the maximum size of graphs free of topological complete subgraphs.
Discret. Math., 2007

On the edge-connectivity and restricted edge-connectivity of a product of graphs.
Discret. Appl. Math., 2007

2005
Sufficient conditions for <i>lambda</i><sup>'</sup>-optimality of graphs with small conditional diameter.
Inf. Process. Lett., 2005

2004
Extremal Graphs without Topological Complete Subgraphs.
SIAM J. Discret. Math., 2004

Minor clique free extremal graphs.
Ars Comb., 2004

2003
Complete bipartite free graphs.
Ars Comb., 2003

2001
Structure of the Extremal Family ex(n;tk<sup>p</sup>).
Electron. Notes Discret. Math., 2001

2000
The Size of a Graph Without Topological Complete Subgraphs.
SIAM J. Discret. Math., 2000

1996
The center of an infinite graph.
Discret. Math., 1996


  Loading...