Camino Balbuena

M. C. Balbuena

	2009
64		Camino Balbuena, M. I. Ortego: The distribution of extremes in the degree sequence: A Gumbel distribution approach. Appl. Math. Lett. 22(4): 553-556 (2009)
63		Camino Balbuena, Jianmin Tang, Kim Marshall, Yuqing Lin: Superconnectivity of regular graphs with small diameter. Discrete Applied Mathematics 157(7): 1349-1353 (2009)
62		Camino Balbuena, D. González-Moreno, Xavier Marcote: On the 3-restricted edge connectivity of permutation graphs. Discrete Applied Mathematics 157(7): 1586-1591 (2009)
61		Yuqing Lin, Camino Balbuena, Mirka Miller: On the number of components of (k, g)-cages after vertex deletion. Discrete Applied Mathematics 157(8): 1760-1765 (2009)
60		Jianmin Tang, Yuqing Lin, Camino Balbuena, Mirka Miller: Calculating the extremal number ex(v;{C3, C4, ..., Cn}). Discrete Applied Mathematics 157(9): 2198-2206 (2009)
	2008
59		Camino Balbuena, Yuqing Lin, Mirka Miller: Diameter-sufficient conditions for a graph to be super-restricted connected. Discrete Applied Mathematics 156(15): 2827-2834 (2008)
58		Camino Balbuena, Pedro García-Vázquez, Xavier Marcote: Connectivity measures in matched sum graphs. Discrete Mathematics 308(10): 1985-1993 (2008)
57		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. Discrete Mathematics 308(12): 2484-2491 (2008)
56		Yuqing Lin, Camino Balbuena, Xavier Marcote, Mirka Miller: On the connectivity of (k, g)-cages of even girth. Discrete Mathematics 308(15): 3249-3256 (2008)
55		Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote: Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. Discrete Mathematics 308(16): 3526-3536 (2008)
54		Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez: On the girth of extremal graphs without shortest cycles. Discrete Mathematics 308(23): 5682-5690 (2008)
53		Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela: Extremal K(s, t)-free Bipartite Graphs. Discrete Mathematics & Theoretical Computer Science 10(3): (2008)
52		Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela: Conditional diameter saturated graphs. Networks 52(4): 196-201 (2008)
	2007
51		Jianmin 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
50		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)
49		Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela: Extremal bipartite graphs with high girth. Ars Comb. 83: (2007)
48		Camino Balbuena, Pedro García-Vázquez: A sufficient condition for Pk-path graphs being r-connected. Discrete Applied Mathematics 155(13): 1745-1751 (2007)
47		Camino 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)
46		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. Discrete Applied Mathematics 155(18): 2444-2455 (2007)
45		Camino Balbuena, Xavier Marcote: Lower connectivities of regular graphs with small diameter. Discrete Mathematics 307(11-12): 1255-1265 (2007)
44		Xavier 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)
43		Camino 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)
42		Camino 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)
41		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. Discrete Mathematics 307(6): 659-667 (2007)
40		Camino 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)
39		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. Discrete Mathematics 307(9-10): 1038-1046 (2007)
38		Camino Balbuena, T. Jiang, Yuqing Lin, Xavier Marcote, Mirka Miller: A lower bound on the order of regular graphs with given girth pair. Journal of Graph Theory 55(2): 153-163 (2007)
37		Camino 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
36		Camino Balbuena, E. Barker, Yuqing Lin, Mirka Miller, Kiki A. Sugeng: Consecutive magic graphs. Discrete Mathematics 306(16): 1817-1829 (2006)
35		Camino 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)
34		Camino Balbuena, G. Araujo, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela: On the order of bi-regular cages of even girth. Electronic Notes in Discrete Mathematics 26: 1-7 (2006)
33		Juan Carlos Valenzuela, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote: Extremal K(s, t)-free bipartite graphs. Electronic Notes in Discrete Mathematics 26: 139-144 (2006)
32		Pedro García-Vázquez, Camino Balbuena, Xavier Marcote, Juan Carlos Valenzuela: On extremal bipartite graphs with high girth. Electronic Notes in Discrete Mathematics 26: 67-73 (2006)
31		Xavier Marcote, Camino Balbuena, Pedro García-Vázquez, Juan Carlos Valenzuela: Highly connected star product graphs. Electronic Notes in Discrete Mathematics 26: 91-96 (2006)
30		Camino 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)
29		Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote: All (k;g)-cages are edge-superconnected. Networks 47(2): 102-110 (2006)
28		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
27		Yuqing Lin, Mirka Miller, Camino Balbuena: Improved lower bound for the vertex connectivity of (delta;;g)-cages. Discrete Mathematics 299(1-3): 162-171 (2005)
26		Xavier 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)
25		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)
24		Camino Balbuena, Xavier Marcote, Daniela Ferrero: Diameter vulnerability of iterated line digraphs in terms of the girth. Networks 45(2): 49-54 (2005)
23		Xavier Marcote, Camino Balbuena, Josep Fàbrega: Connectedness of digraphs and graphs under constraints on the conditional diameter. Networks 45(2): 80-87 (2005)
22		Camino Balbuena, Xavier Marcote, Pedro García-Vázquez: On restricted connectivities of permutation graphs. Networks 45(3): 113-118 (2005)
	2004
21		Camino Balbuena, Pedro García-Vázquez: Edge-connectivity in Pk-path graphs. Discrete Mathematics 286(3): 213-218 (2004)
20		Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo: Diameter, short paths and superconnectivity in digraphs. Discrete Mathematics 288(1-3): 113-123 (2004)
19		Xavier Marcote, Camino Balbuena: Edge-superconnectivity of cages. Networks 43(1): 54-59 (2004)
	2003
18		J. Gómez, Ignacio M. Pelayo, Camino Balbuena: Diameter vulnerability of GC graphs. Discrete Applied Mathematics 130(3): 395-416 (2003)
17		Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena: Every cubic cage is quasi 4-connected. Discrete Mathematics 266(1-3): 311-320 (2003)
16		Ignacio 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)
15		Camino Balbuena, Daniela Ferrero: Edge-connectivity and super edge-connectivity of P2-path graphs. Discrete Mathematics 269(1-3): 13-20 (2003)
14		Camino 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
13		Camino Balbuena, Ignacio M. Pelayo, J. Gómez: On the superconnectivity of generalized p-cycles. Discrete Mathematics 255(1-3): 13-23 (2002)
12		Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo: Superconnected digraphs and graphs with small conditional diameters. Networks 39(3): 153-160 (2002)
	2001
11		Ignacio M. Pelayo, Camino Balbuena, J. Gómez: On the connectivity of generalized p-cycles. Ars Comb. 58: (2001)
10		Camino Balbuena, Angeles Carmona: On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs. Ars Comb. 61: (2001)
9		Camino Balbuena: Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence. Electronic Notes in Discrete Mathematics 10: 13-16 (2001)
8		Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena: Every Cubic Cage is quasi 4-connected. Electronic Notes in Discrete Mathematics 10: 216-219 (2001)
	1999
7		Camino Balbuena: Extraconnectivity of s-geodetic digraphs and graphs. Discrete Mathematics 195(1-3): 39-52 (1999)
6		Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol: Superconnectivity of bipartite digraphs and graphs. Discrete Mathematics 197-198: 61-75 (1999)
5		J. Gómez, Ignacio M. Pelayo, Camino Balbuena: New large graphs with given degree and diameter six. Networks 34(2): 154-161 (1999)
	1997
4		Camino 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)
3		M. 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)
2		M. 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
1		Camino 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

1	G. Araujo	[34]
2	Gabriela Araujo-Pardo	[57]
3	E. Barker	[35] [36]
4	Angeles Carmona	[1] [2] [3] [4] [6] [10]
5	Martín Cera	[25] [39] [41] [42] [46] [54] [55]
6	K. C. Das	[35]
7	Ana Diánez	[25] [39] [41] [42] [46] [54] [55]
8	Josep Fàbrega	[1] [2] [3] [4] [6] [12] [16] [23] [26] [47]
9	Daniela Ferrero	[14] [15] [24]
10	Miguel Angel Fiol	[1] [2] [3] [4] [6]
11	Pedro García-Vázquez	[21] [22] [25] [28] [30] [31] [32] [33] [34] [37] [39] [40] [41] [42] [43] [46] [47] [48] [49] [50] [52] [53] [54] [55] [57] [58]
12	J. Gómez	[5] [11] [13] [18]
13	D. González-Moreno	[62]
14	T. Jiang	[38]
15	Yuqing Lin	[27] [29] [35] [36] [38] [51] [56] [59] [60] [61] [63]
16	Xavier Marcote	[8] [12] [14] [16] [17] [19] [20] [22] [23] [24] [25] [26] [28] [29] [30] [31] [32] [33] [34] [38] [40] [41] [42] [43] [44] [45] [46] [49] [50] [52] [53] [55] [56] [57] [58] [62]
17	Kim Marshall	[63]
18	Mirka Miller	[27] [29] [35] [36] [38] [51] [56] [59] [60] [61]
19	M. I. Ortego	[64]
20	Ignacio M. Pelayo	[5] [8] [11] [12] [13] [14] [16] [17] [18] [20] [26] [44]
21	Joseph F. Ryan	[35]
22	Slamin	[35]
23	Kiki A. Sugeng	[35] [36]
24	Jianmin Tang	[51] [60] [63]
25	Michal Tkác	[35]
26	Juan Carlos Valenzuela	[31] [32] [33] [34] [40] [43] [49] [50] [52] [53] [57]

Colors in the list of coauthors