default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPedro García-Vázquez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j42]Pedro García-Vázquez
:
On the bipartite vertex frustration of graphs. Electron. Notes Discret. Math. 54: 289-294 (2016)- 2014
- [j41]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: 90-99 (2014) - 2013
- [j40]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): 2795-2801 (2013) - [j39]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): 1490-1495 (2013) - [j38]Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano:
On the super-restricted arc-connectivity of s -geodetic digraphs. Networks 61(1): 20-28 (2013) - 2012
- [j37]Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano:
Restricted arc-connectivity of generalized p-cycles. Discret. Appl. Math. 160(9): 1325-1332 (2012) - 2011
- [j36]Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano, Julián Salas:
On the λ′-optimality in graphs with odd girth g and even girth h. Appl. Math. Lett. 24(7): 1041-1045 (2011) - [j35]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): 91-99 (2011) - [j34]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): 2697-2706 (2011) - 2010
- [j33]Camino Balbuena, Pedro García-Vázquez:
Edge fault tolerance analysis of super k-restricted connected networks. Appl. Math. Comput. 216(2): 506-513 (2010) - [j32]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): 1680-1688 (2010)
2000 – 2009
- 2009
- [j31]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: 537-541 (2009) - 2008
- [j30]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Connectivity measures in matched sum graphs. Discret. Math. 308(10): 1985-1993 (2008) - [j29]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): 2484-2491 (2008) - [j28]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): 3526-3536 (2008) - [j27]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): 5682-5690 (2008) - [j26]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) - [j25]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Conditional diameter saturated graphs. Networks 52(4): 196-201 (2008) - 2007
- [j24]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): 370-375 (2007) - [j23]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Extremal bipartite graphs with high girth. Ars Comb. 83 (2007) - [j22]Camino Balbuena, Pedro García-Vázquez:
A sufficient condition for Pk-path graphs being r-connected. Discret. Appl. Math. 155(13): 1745-1751 (2007) - [j21]Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez:
Edge-connectivity and edge-superconnectivity in sequence graphs. Discret. Appl. Math. 155(16): 2053-2060 (2007) - [j20]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): 2444-2455 (2007) - [j19]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): 155-162 (2007) - [j18]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): 659-667 (2007) - [j17]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Counterexample to a conjecture of Györi on C2l-free bipartite graphs. Discret. Math. 307(6): 748-749 (2007) - [j16]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): 1038-1046 (2007) - [j15]Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela:
Graphs without minor complete subgraphs. Discret. Math. 307(11-12): 1276-1284 (2007) - [j14]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
New results on the Zarankiewicz problem. Discret. Math. 307(17-18): 2322-2327 (2007) - [j13]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): 251-257 (2007) - 2006
- [j12]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: 1-7 (2006) - [j11]Pedro García-Vázquez, Camino Balbuena, Xavier Marcote, Juan Carlos Valenzuela:
On extremal bipartite graphs with high girth. Electron. Notes Discret. Math. 26: 67-73 (2006) - [j10]Xavier Marcote, Camino Balbuena, Pedro García-Vázquez, Juan Carlos Valenzuela:
Highly connected star product graphs. Electron. Notes Discret. Math. 26: 91-96 (2006) - [j9]Juan Carlos Valenzuela, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Extremal K(s, t)-free bipartite graphs. Electron. Notes Discret. Math. 26: 139-144 (2006) - [j8]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Sufficient conditions for lambda'-optimality in graphs with girth g. J. Graph Theory 52(1): 73-86 (2006) - [j7]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Reliability of interconnection networks modeled by a product of graphs. Networks 48(3): 114-120 (2006) - 2005
- [j6]Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
Sufficient conditions for lambda'-optimality of graphs with small conditional diameter. Inf. Process. Lett. 95(4): 429-434 (2005) - [j5]Camino Balbuena, Xavier Marcote, Pedro García-Vázquez:
On restricted connectivities of permutation graphs. Networks 45(3): 113-118 (2005) - 2004
- [j4]Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela:
Minor clique free extremal graphs. Ars Comb. 73 (2004) - [j3]Camino Balbuena, Pedro García-Vázquez:
Edge-connectivity in Pk-path graphs. Discret. Math. 286(3): 213-218 (2004) - 2003
- [j2]Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela:
Complete bipartite free graphs. Ars Comb. 69 (2003) - 2001
- [j1]Martín Cera, Ana Diánez, Pedro García-Vázquez:
Structure of the Extremal Family ex(n;tkp). Electron. Notes Discret. Math. 10: 72-74 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
