Camino Balbuena

M. C. Balbuena

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2007
43EEJianmin Tang, Camino Balbuena, Yuqing Lin, Mirka Miller: An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected. CATS 2007: 141-144
42EECamino 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)
41EECamino Balbuena, Pedro García-Vázquez: A sufficient condition for Pk-path graphs being r-connected. Discrete Applied Mathematics 155(13): 1745-1751 (2007)
40EECamino Balbuena, Josep Fàbrega, Pedro García-Vázquez: Edge-connectivity and edge-superconnectivity in sequence graphs. Discrete Applied Mathematics 155(16): 2053-2060 (2007)
39EECamino 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. Discrete Applied Mathematics 155(18): 2444-2455 (2007)
38EECamino Balbuena, Xavier Marcote: Lower connectivities of regular graphs with small diameter. Discrete Mathematics 307(11-12): 1255-1265 (2007)
37EEXavier Marcote, Camino Balbuena, Ignacio M. Pelayo: On the connectivity of cages with girth five, six and eight. Discrete Mathematics 307(11-12): 1441-1446 (2007)
36EECamino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela: New results on the Zarankiewicz problem. Discrete Mathematics 307(17-18): 2322-2327 (2007)
35EECamino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote: Connectivity of graphs with given girth pair. Discrete Mathematics 307(2): 155-162 (2007)
34EECamino 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. Discrete Mathematics 307(6): 659-667 (2007)
33EECamino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela: Counterexample to a conjecture of Györi on C2l-free bipartite graphs. Discrete Mathematics 307(6): 748-749 (2007)
32EECamino 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. Discrete Mathematics 307(9-10): 1038-1046 (2007)
31EECamino Balbuena, Pedro García-Vázquez: On the Minimum Order of Extremal Graphs to have a Prescribed Girth. SIAM J. Discrete Math. 21(1): 251-257 (2007)
2006
30EECamino Balbuena, E. Barker, Yuqing Lin, Mirka Miller, Kiki A. Sugeng: Consecutive magic graphs. Discrete Mathematics 306(16): 1817-1829 (2006)
29EECamino Balbuena, E. Barker, K. C. Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, Kiki A. Sugeng, Michal Tkác: On the degrees of a strongly vertex-magic graph. Discrete Mathematics 306(6): 539-551 (2006)
28EECamino Balbuena, Pedro García-Vázquez, Xavier Marcote: Sufficient conditions for lambda'-optimality in graphs with girth g. Journal of Graph Theory 52(1): 73-86 (2006)
27EEYuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote: All (k;g)-cages are edge-superconnected. Networks 47(2): 102-110 (2006)
26EECamino 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
25EEYuqing Lin, Mirka Miller, Camino Balbuena: Improved lower bound for the vertex connectivity of (delta;;g)-cages. Discrete Mathematics 299(1-3): 162-171 (2005)
24EEXavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega: (delta, g)-cages with g geq 10 are 4-connected. Discrete Mathematics 301(1): 124-136 (2005)
23EECamino 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)
22EECamino Balbuena, Xavier Marcote, Daniela Ferrero: Diameter vulnerability of iterated line digraphs in terms of the girth. Networks 45(2): 49-54 (2005)
21EEXavier Marcote, Camino Balbuena, Josep Fàbrega: Connectedness of digraphs and graphs under constraints on the conditional diameter. Networks 45(2): 80-87 (2005)
20EECamino Balbuena, Xavier Marcote, Pedro García-Vázquez: On restricted connectivities of permutation graphs. Networks 45(3): 113-118 (2005)
2004
19EECamino Balbuena, Pedro García-Vázquez: Edge-connectivity in Pk-path graphs. Discrete Mathematics 286(3): 213-218 (2004)
18EEXavier Marcote, Camino Balbuena, Ignacio M. Pelayo: Diameter, short paths and superconnectivity in digraphs. Discrete Mathematics 288(1-3): 113-123 (2004)
17EEXavier Marcote, Camino Balbuena: Edge-superconnectivity of cages. Networks 43(1): 54-59 (2004)
2003
16EEJ. Gómez, Ignacio M. Pelayo, Camino Balbuena: Diameter vulnerability of GC graphs. Discrete Applied Mathematics 130(3): 395-416 (2003)
15EEXavier Marcote, Ignacio M. Pelayo, Camino Balbuena: Every cubic cage is quasi 4-connected. Discrete Mathematics 266(1-3): 311-320 (2003)
14EEIgnacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega: Using a progressive withdrawal procedure to study superconnectivity in digraphs. Discrete Mathematics 267(1-3): 229-246 (2003)
13EECamino Balbuena, Daniela Ferrero: Edge-connectivity and super edge-connectivity of P2-path graphs. Discrete Mathematics 269(1-3): 13-20 (2003)
12EECamino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo: Algebraic properties of a digraph and its line digraph. Journal of Interconnection Networks 4(4): 377-393 (2003)
2002
11EECamino Balbuena, Ignacio M. Pelayo, J. Gómez: On the superconnectivity of generalized p-cycles. Discrete Mathematics 255(1-3): 13-23 (2002)
10EECamino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo: Superconnected digraphs and graphs with small conditional diameters. Networks 39(3): 153-160 (2002)
2001
9 Ignacio M. Pelayo, Camino Balbuena, J. Gómez: On the connectivity of generalized p-cycles. Ars Comb. 58: (2001)
8 Camino Balbuena, Angeles Carmona: On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs. Ars Comb. 61: (2001)
1999
7EECamino Balbuena: Extraconnectivity of s-geodetic digraphs and graphs. Discrete Mathematics 195(1-3): 39-52 (1999)
6EECamino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol: Superconnectivity of bipartite digraphs and graphs. Discrete Mathematics 197-198: 61-75 (1999)
5EEJ. Gómez, Ignacio M. Pelayo, Camino Balbuena: New large graphs with given degree and diameter six. Networks 34(2): 154-161 (1999)
1997
4EECamino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol: Extraconnectivity of graphs with large minimum degree and girth. Discrete Mathematics 167-168: 85-100 (1997)
3EEM. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol: On the order and size of s-geodetic digraphs with given connectivity. Discrete Mathematics 174(1-3): 19-27 (1997)
2EEM. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol: Connectivity of large bipartite digraphs and graphs. Discrete Mathematics 174(1-3): 3-17 (1997)
1996
1EECamino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol: On the connectivity and the conditional diameter of graphs and digraphs. Networks 28(2): 97-105 (1996)

Coauthor Index

1E. Barker [29] [30]
2Angeles Carmona [1] [2] [3] [4] [6] [8]
3Martín Cera [23] [32] [34] [35] [39]
4K. C. Das [29]
5Ana Diánez [23] [32] [34] [35] [39]
6Josep Fàbrega [1] [2] [3] [4] [6] [10] [14] [21] [24] [40]
7Daniela Ferrero [12] [13] [22]
8Miguel Angel Fiol [1] [2] [3] [4] [6]
9Pedro García-Vázquez [19] [20] [23] [26] [28] [31] [32] [33] [34] [35] [36] [39] [40] [41] [42]
10J. Gómez [5] [9] [11] [16]
11Yuqing Lin [25] [27] [29] [30] [43]
12Xavier Marcote [10] [12] [14] [15] [17] [18] [20] [21] [22] [23] [24] [26] [27] [28] [33] [34] [35] [36] [37] [38] [39] [42]
13Mirka Miller [25] [27] [29] [30] [43]
14Ignacio M. Pelayo [5] [9] [10] [11] [12] [14] [15] [16] [18] [24] [37]
15Joseph F. Ryan [29]
16 Slamin [29]
17Kiki A. Sugeng [29] [30]
18Jianmin Tang [43]
19Michal Tkác [29]
20Juan Carlos Valenzuela [33] [36] [42]

Copyright © Thu Sep 4 18:13:36 2008 by Michael Ley (ley@uni-trier.de)