The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Camino Balbuena: [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. Camino Balbuena, Angeles Carmona
    On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:61, n:, pp:- [Journal]
  3. Ignacio M. Pelayo, Camino Balbuena, J. Gómez
    On the connectivity of generalized p-cycles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  4. J. Gómez, Ignacio M. Pelayo, Camino Balbuena
    Diameter vulnerability of GC graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:395-416 [Journal]
  5. Camino Balbuena, E. Barker, K. C. Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, K. A. Sugeng, Michal Tkác
    On the degrees of a strongly vertex-magic graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:6, pp:539-551 [Journal]
  6. Camino Balbuena, Daniela Ferrero
    Edge-connectivity and super edge-connectivity of P2-path graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:13-20 [Journal]
  7. 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]
  8. Camino Balbuena, Ignacio M. Pelayo, J. Gómez
    On the superconnectivity of generalized p-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:255, n:1-3, pp:13-23 [Journal]
  9. Yuqing Lin, Mirka Miller, Camino Balbuena
    Improved lower bound for the vertex connectivity of (delta;;g)-cages. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:162-171 [Journal]
  10. Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo
    Diameter, short paths and superconnectivity in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:288, n:1-3, pp:113-123 [Journal]
  11. Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega
    (delta, g)-cages with g geq 10 are 4-connected. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:301, n:1, pp:124-136 [Journal]
  12. Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena
    Every cubic cage is quasi 4-connected. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:311-320 [Journal]
  13. Ignacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega
    Using a progressive withdrawal procedure to study superconnectivity in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:267, n:1-3, pp:229-246 [Journal]
  14. Camino Balbuena, E. Barker, Yuqing Lin, Mirka Miller, K. A. Sugeng
    Consecutive magic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1817-1829 [Journal]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo
    On the connectivity of cages with girth five, six and eight. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1441-1446 [Journal]
  20. Camino Balbuena, Xavier Marcote
    Lower connectivities of regular graphs with small diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1255-1265 [Journal]
  21. 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]
  22. Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo
    Algebraic properties of a digraph and its line digraph. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2003, v:4, n:4, pp:377-393 [Journal]
  23. Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    On the connectivity and the conditional diameter of graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:2, pp:97-105 [Journal]
  24. Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo
    Superconnected digraphs and graphs with small conditional diameters. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:3, pp:153-160 [Journal]
  25. Camino Balbuena, Xavier Marcote, Daniela Ferrero
    Diameter vulnerability of iterated line digraphs in terms of the girth. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:2, pp:49-54 [Journal]
  26. 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]
  27. J. Gómez, Ignacio M. Pelayo, Camino Balbuena
    New large graphs with given degree and diameter six. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:2, pp:154-161 [Journal]
  28. Xavier Marcote, Camino Balbuena
    Edge-superconnectivity of cages. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:1, pp:54-59 [Journal]
  29. Xavier Marcote, Camino Balbuena, Josep Fàbrega
    Connectedness of digraphs and graphs under constraints on the conditional diameter. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:2, pp:80-87 [Journal]
  30. 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]
  31. Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote
    All (k;g)-cages are edge-superconnected. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:2, pp:102-110 [Journal]
  32. 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]
  33. 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]
  34. 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]
  35. Camino Balbuena
    Extraconnectivity of s-geodetic digraphs and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:39-52 [Journal]
  36. Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    Superconnectivity of bipartite digraphs and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:61-75 [Journal]
  37. Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    Extraconnectivity of graphs with large minimum degree and girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:85-100 [Journal]
  38. 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]

  39. An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected. [Citation Graph (, )][DBLP]


  40. The distribution of extremes in the degree sequence: A Gumbel distribution approach. [Citation Graph (, )][DBLP]


  41. Kernels and partial line digraphs. [Citation Graph (, )][DBLP]


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


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


  44. Diameter-sufficient conditions for a graph to be super-restricted connected. [Citation Graph (, )][DBLP]


  45. Superconnectivity of regular graphs with small diameter. [Citation Graph (, )][DBLP]


  46. On the number of components of (k, g)-cages after vertex deletion. [Citation Graph (, )][DBLP]


  47. On the 3-restricted edge connectivity of permutation graphs. [Citation Graph (, )][DBLP]


  48. Calculating the extremal number ex(v;{C3, C4, ..., Cn}). [Citation Graph (, )][DBLP]


  49. On the connectivity and superconnected graphs with small diameter. [Citation Graph (, )][DBLP]


  50. New families of graphs without short cycles and large size. [Citation Graph (, )][DBLP]


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


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


  53. On the connectivity of (k, g)-cages of even girth. [Citation Graph (, )][DBLP]


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


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


  56. Constructions of bi-regular cages. [Citation Graph (, )][DBLP]


  57. Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages. [Citation Graph (, )][DBLP]


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


Search in 0.034secs, Finished in 0.036secs
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