Pedro García-Vázquez

According to our database1, Pedro García-Vázquez authored at least 40 papers between 2001 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
On the bipartite vertex frustration of graphs.
Electron. Notes Discret. Math., 2016

2014
On the connectivity and restricted edge-connectivity of 3-arc graphs.
Discret. Appl. Math., 2014

2013
On the super-restricted arc-connectivity of <i>s</i> -geodetic digraphs.
Networks, 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
Restricted arc-connectivity of generalized p-cycles.
Discret. Appl. Math., 2012

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

On the λ<sup>′</sup>-optimality in graphs with odd girth g and even girth h.
Appl. Math. Lett., 2011

2010
On the Ramsey numbers for stars versus complete graphs.
Eur. J. Comb., 2010

Edge fault tolerance analysis of super k-restricted connected networks.
Appl. Math. Comput., 2010

2009
On the Superconnectivity in graphs with odd girth g and even girth h.
Electron. Notes Discret. Math., 2009

2008
Conditional diameter saturated graphs.
Networks, 2008

Extremal K(s, t)-free Bipartite Graphs.
Discret. Math. Theor. Comput. Sci., 2008

Connectivity measures in matched sum graphs.
Discret. Math., 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

On the order of ({r, m};g)-cages of even girth.
Discret. Math., 2008

2007
On the Minimum Order of Extremal Graphs to have a Prescribed Girth.
SIAM J. Discret. Math., 2007

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

New results on the Zarankiewicz problem.
Discret. Math., 2007

Counterexample to a conjecture of Györi on C<sub>2l</sub>-free bipartite graphs.
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

A sufficient condition for P<sub>k</sub>-path graphs being r-connected.
Discret. Appl. Math., 2007

Edge-connectivity and edge-superconnectivity in sequence graphs.
Discret. Appl. Math., 2007

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

Trees having an even or quasi even degree sequence are graceful.
Appl. Math. Lett., 2007

2006
Reliability of interconnection networks modeled by a product of graphs.
Networks, 2006

Sufficient conditions for lambda'-optimality in graphs with girth <i>g</i>.
J. Graph Theory, 2006

Extremal K<sub>(s, t)</sub>-free bipartite graphs.
Electron. Notes Discret. Math., 2006

Highly connected star product graphs.
Electron. Notes Discret. Math., 2006

On extremal bipartite graphs with high girth.
Electron. Notes Discret. Math., 2006

On the order of bi-regular cages of even girth.
Electron. Notes Discret. Math., 2006

2005
On restricted connectivities of permutation graphs.
Networks, 2005

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

2004
Edge-connectivity in <i>P<sub>k</sub></i>-path graphs.
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


  Loading...