The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pedro García-Vázquez: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
    Trees having an even or quasi even degree sequence are graceful. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2007, v:20, n:4, pp:370-375 [Journal]
  2. Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
    Complete bipartite free graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  3. Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
    Minor clique free extremal graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  4. Camino Balbuena, Pedro García-Vázquez
    Edge-connectivity in Pk-path graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:213-218 [Journal]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:659-667 [Journal]
  6. Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
    Counterexample to a conjecture of Györi on C2l-free bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:748-749 [Journal]
  7. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1038-1046 [Journal]
  8. Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
    Connectivity of graphs with given girth pair. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:155-162 [Journal]
  9. Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
    Graphs without minor complete subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1276-1284 [Journal]
  10. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:4, pp:429-434 [Journal]
  11. Camino Balbuena, Xavier Marcote, Pedro García-Vázquez
    On restricted connectivities of permutation graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:3, pp:113-118 [Journal]
  12. Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
    Reliability of interconnection networks modeled by a product of graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:3, pp:114-120 [Journal]
  13. Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
    Sufficient conditions for lambda'-optimality in graphs with girth g. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:1, pp:73-86 [Journal]
  14. Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez
    Edge-connectivity and edge-superconnectivity in sequence graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2053-2060 [Journal]
  15. Camino Balbuena, Pedro García-Vázquez
    A sufficient condition for Pk-path graphs being r-connected. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:13, pp:1745-1751 [Journal]
  16. Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
    New results on the Zarankiewicz problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:17-18, pp:2322-2327 [Journal]

  17. Extremal bipartite graphs with high girth. [Citation Graph (, )][DBLP]


  18. On the edge-connectivity and restricted edge-connectivity of a product of graphs. [Citation Graph (, )][DBLP]


  19. Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. [Citation Graph (, )][DBLP]


  20. On the order of ({r, m};g)-cages of even girth. [Citation Graph (, )][DBLP]


  21. Connectivity measures in matched sum graphs. [Citation Graph (, )][DBLP]


  22. On the girth of extremal graphs without shortest cycles. [Citation Graph (, )][DBLP]


  23. Extremal K(s, t)-free Bipartite Graphs. [Citation Graph (, )][DBLP]


  24. On the Ramsey numbers for stars versus complete graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002