Pedro García-Vázquez

Publication Activity (10 Years)

Years Active: 2001-2016
Publications (10 Years): 1

Top Topics

Topological Information

Strongly Connected

Hamiltonian Cycle

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Pedro García-Vázquez
On the bipartite vertex frustration of graphs. Electron. Notes Discret. Math. 54 (2016)
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano
On the connectivity and restricted edge-connectivity of 3-arc graphs. Discret. Appl. Math. 162 (2014)
Encarnación Abajo, Rocío M. Casablanca, Ana Diánez, Pedro García-Vázquez
The Menger number of the strong product of graphs. Discret. Math. 313 (13) (2013)
Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano
-geodetic digraphs. Networks 61 (1) (2013)
Encarnación Abajo, Rocío M. Casablanca, Ana Diánez, Pedro García-Vázquez
On average connectivity of the strong product of graphs. Discret. Appl. Math. 161 (18) (2013)
Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano
Restricted arc-connectivity of generalized p-cycles. Discret. Appl. Math. 160 (9) (2012)
Rocío M. Casablanca, Ana Diánez, Pedro García-Vázquez
Toughness of the corona of two graphs. Int. J. Comput. Math. 88 (13) (2011)
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano, Julián Salas
-optimality in graphs with odd girth g and even girth h. Appl. Math. Lett. 24 (7) (2011)
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano
Superconnectivity of graphs with odd girth g and even girth h. Discret. Appl. Math. 159 (2-3) (2011)
Luis Boza, Martín Cera, Pedro García-Vázquez, M. P. Revuelta
On the Ramsey numbers for stars versus complete graphs. Eur. J. Comb. 31 (7) (2010)
Camino Balbuena, Pedro García-Vázquez
Edge fault tolerance analysis of super k-restricted connected networks. Appl. Math. Comput. 216 (2) (2010)
Luis Pedro Montejano, Camino Balbuena, Pedro García-Vázquez
On the Superconnectivity in graphs with odd girth g and even girth h. Electron. Notes Discret. Math. 34 (2009)
Gabriela Araujo-Pardo, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
On the order of ({r, m};g)-cages of even girth. Discret. Math. 308 (12) (2008)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
Connectivity measures in matched sum graphs. Discret. Math. 308 (10) (2008)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
Extremal K(s, t)-free Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
Conditional diameter saturated graphs. Networks 52 (4) (2008)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. Discret. Math. 308 (16) (2008)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez
On the girth of extremal graphs without shortest cycles. Discret. Math. 308 (23) (2008)
Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
Graphs without minor complete subgraphs. Discret. Math. 307 (11-12) (2007)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
New results on the Zarankiewicz problem. Discret. Math. 307 (17-18) (2007)
Camino Balbuena, Pedro García-Vázquez
-path graphs being r-connected. Discret. Appl. Math. 155 (13) (2007)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez
New exact values of the maximum size of graphs free of topological complete subgraphs. Discret. Math. 307 (9-10) (2007)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
Extremal bipartite graphs with high girth. Ars Comb. 83 (2007)
Camino Balbuena, Pedro García-Vázquez
On the Minimum Order of Extremal Graphs to have a Prescribed Girth. SIAM J. Discret. Math. 21 (1) (2007)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
-free bipartite graphs. Discret. Math. 307 (6) (2007)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
On the edge-connectivity and restricted edge-connectivity of a product of graphs. Discret. Appl. Math. 155 (18) (2007)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
On the restricted connectivity and superconnectivity in graphs with given girth. Discret. Math. 307 (6) (2007)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
Trees having an even or quasi even degree sequence are graceful. Appl. Math. Lett. 20 (4) (2007)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
Connectivity of graphs with given girth pair. Discret. Math. 307 (2) (2007)
Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez
Edge-connectivity and edge-superconnectivity in sequence graphs. Discret. Appl. Math. 155 (16) (2007)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
Reliability of interconnection networks modeled by a product of graphs. Networks 48 (3) (2006)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
. J. Graph Theory 52 (1) (2006)
Pedro García-Vázquez, Camino Balbuena, Xavier Marcote, Juan Carlos Valenzuela
On extremal bipartite graphs with high girth. Electron. Notes Discret. Math. 26 (2006)
Xavier Marcote, Camino Balbuena, Pedro García-Vázquez, Juan Carlos Valenzuela
Highly connected star product graphs. Electron. Notes Discret. Math. 26 (2006)
Juan Carlos Valenzuela, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
-free bipartite graphs. Electron. Notes Discret. Math. 26 (2006)
Camino Balbuena, Gabriela Araujo-Pardo, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
On the order of bi-regular cages of even girth. Electron. Notes Discret. Math. 26 (2006)
Camino Balbuena, Xavier Marcote, Pedro García-Vázquez
On restricted connectivities of permutation graphs. Networks 45 (3) (2005)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
-optimality of graphs with small conditional diameter. Inf. Process. Lett. 95 (4) (2005)
Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
Minor clique free extremal graphs. Ars Comb. 73 (2004)
Camino Balbuena, Pedro García-Vázquez
-path graphs. Discret. Math. 286 (3) (2004)
Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
Complete bipartite free graphs. Ars Comb. 69 (2003)
Martín Cera, Ana Diánez, Pedro García-Vázquez
). Electron. Notes Discret. Math. 10 (2001)