default search action
Camino Balbuena
M. C. Balbuena – Camino Balbuena Martínez
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [j122]Camino Balbuena, Cristina Dalfó
, Berenice Martínez-Barona:
Sufficient conditions for a digraph to admit a (1, \le l)-identifying code. Discuss. Math. Graph Theory 41(4): 853-872 (2021) - 2020
- [j121]Camino Balbuena, Cristina Dalfó
Identifying codes in line digraphs. Appl. Math. Comput. 383: 125357 (2020)
2010 – 2019
- 2019
- [j120]Camino Balbuena
The p-restricted edge-connectivity of Kneser graphs. Appl. Math. Comput. 343: 258-267 (2019) - [j119]Encarnación Abajo, Camino Balbuena
Improving bounds on the order of regular graphs of girth 5. Discret. Math. 342(10): 2900-2910 (2019) - [j118]Camino Balbuena, Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
About (k, l)-kernels, semikernels and Grundy functions in partial line digraphs. Discuss. Math. Graph Theory 39(4): 855-866 (2019) - 2018
- [j117]Marién Abreu, Gabriela Araujo-Pardo
An alternate description of a (q + 1, 8)-cage. Art Discret. Appl. Math. 1(2): #P2.07 (2018) - [j116]Camino Balbuena
Bounds on the k-restricted arc connectivity of some bipartite tournaments. Appl. Math. Comput. 331: 54-60 (2018) - [j115]Camino Balbuena
Rainbow connectivity of Moore cages of girth 6. Discret. Appl. Math. 250: 104-109 (2018) - [j114]Camino Balbuena
Vertex disjoint 4-cycles in bipartite tournaments. Discret. Math. 341(4): 1103-1108 (2018) - [j113]Encarnación Abajo, Camino Balbuena, Manuel Bendala:
Elliptic semiplanes and regular graphs with girth 5. Electron. Notes Discret. Math. 68: 245-250 (2018) - 2017
- [j112]Gabriela Araujo-Pardo
A family of mixed graphs with large order and diameter 2. Discret. Appl. Math. 218: 57-63 (2017) - [j111]Encarnación Abajo, Gabriela Araujo-Pardo
New small regular graphs of girth 5. Discret. Math. 340(8): 1878-1888 (2017) - 2016
- [j110]Diego González-Moreno
Vertex-disjoint cycles in bipartite tournaments. Electron. Notes Discret. Math. 54: 69-72 (2016) - [j109]Encarnación Abajo, Gabriela Araujo-Pardo
New family of small regular graphs of girth 5. Electron. Notes Discret. Math. 54: 139-144 (2016) - [j108]Gabriela Araujo-Pardo
A construction of dense mixed graphs of diameter 2. Electron. Notes Discret. Math. 54: 235-240 (2016) - [j107]Mucuy-kak Guevara, Camino Balbuena, Hortensia Galeana-Sánchez:
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs. Electron. Notes Discret. Math. 54: 265-269 (2016) - 2015
- [j106]Marién Abreu, Gabriela Araujo-Pardo
A Construction of Small (q-1)-Regular Graphs of Girth 8. Electron. J. Comb. 22(2): 2 (2015) - [j105]Camino Balbuena, Florent Foucaud, Adriana Hansberg:
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5. Electron. J. Comb. 22(2): 2 (2015) - [j104]Marién Abreu, Gabriela Araujo-Pardo
Small Regular Graphs of Girth 7. Electron. J. Comb. 22(3): 3 (2015) - [j103]Camino Balbuena, Mika Olsen
On the acyclic disconnection and the girth. Discret. Appl. Math. 186: 13-18 (2015) - [j102]Camino Balbuena
On a conjecture on the order of cages with a given girth pair. Discret. Appl. Math. 190-191: 24-33 (2015) - [j101]Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning:
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs. Graphs Comb. 31(5): 1163-1176 (2015) - 2014
- [j100]Camino Balbuena, Pedro García-Vázquez
On the connectivity and restricted edge-connectivity of 3-arc graphs. Discret. Appl. Math. 162: 90-99 (2014) - [j99]Camino Balbuena
On the order of graphs with a given girth pair. Discret. Math. 321: 68-75 (2014) - [i1]Camino Balbuena, Florent Foucaud, Adriana Hansberg:
Locating-dominating sets and identifying codes in graphs of girth at least 5. CoRR abs/1407.7263 (2014) - 2013
- [j98]Marién Abreu, Gabriela Araujo-Pardo
Biregular Cages of Girth Five. Electron. J. Comb. 20(1): 71 (2013) - [j97]Camino Balbuena, Xavier Marcote:
The k-restricted edge-connectivity of a product of graphs. Discret. Appl. Math. 161(1-2): 52-59 (2013) - [j96]Camino Balbuena, Diego González-Moreno
A note on the upper bound and girth pair of (k;g)-cages. Discret. Appl. Math. 161(6): 853-857 (2013) - [j95]Camino Balbuena, Mirka Miller, Jozef Sirán, Mária Zdímalová:
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes. Discret. Math. 313(19): 2014-2019 (2013) - [j94]Marién Abreu
Constructions of biregular cages of girth five. Electron. Notes Discret. Math. 40: 9-14 (2013) - [j93]Gloria López-Chávez, Gabriela Araujo-Pardo
Bounds on the order of biregular graphs with even girth at least 8. Electron. Notes Discret. Math. 40: 59-63 (2013) - [j92]Marién Abreu
Families of small regular graphs of girth 7. Electron. Notes Discret. Math. 40: 341-345 (2013) - [j91]Hongliang Lu, Yunjian Wu, Yuqing Lin
On Superconnectivity of (4, g)-Cages. Graphs Comb. 29(1): 105-119 (2013) - [j90]Camino Balbuena, Pedro García-Vázquez
On the super-restricted arc-connectivity of s -geodetic digraphs. Networks 61(1): 20-28 (2013) - 2012
- [j89]Camino Balbuena
A new bound for the connectivity of cages. Appl. Math. Lett. 25(11): 1676-1680 (2012) - [j88]Encarnación Abajo, Camino Balbuena, Ana Diánez
Girth of {C3, ..., Cs}-free extremal graphs. Discret. Appl. Math. 160(9): 1311-1318 (2012) - [j87]Camino Balbuena, Pedro García-Vázquez
Restricted arc-connectivity of generalized p-cycles. Discret. Appl. Math. 160(9): 1325-1332 (2012) - [j86]Marién Abreu
Families of small regular graphs of girth 5. Discret. Math. 312(18): 2832-2842 (2012) - 2011
- [j85]Camino Balbuena, Pedro García-Vázquez
On the λ′-optimality in graphs with odd girth g and even girth h. Appl. Math. Lett. 24(7): 1041-1045 (2011) - [j84]Camino Balbuena, Xavier Marcote:
Monotonicity of the order of (D;g)-cages. Appl. Math. Lett. 24(11): 1933-1937 (2011) - [j83]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) - [j82]Gabriela Araujo-Pardo
Partial linear spaces and identifying codes. Eur. J. Comb. 32(3): 344-351 (2011) - [j81]Julián Salas
New results on connectivity of cages. Electron. Notes Discret. Math. 38: 93-99 (2011) - [j80]Camino Balbuena, Xavier Marcote:
Diameter and connectivity of (D; g)-cages. Int. J. Comput. Math. 88(7): 1387-1397 (2011) - [j79]Gabriela Araujo-Pardo
Constructions of small regular bipartite graphs of girth 6. Networks 57(2): 121-127 (2011) - [j78]Camino Balbuena
Edge-superconnectivity of semiregular cages with odd girth. Networks 58(3): 201-206 (2011) - 2010
- [j77]Camino Balbuena
Edge fault tolerance analysis of super k-restricted connected networks. Appl. Math. Comput. 216(2): 506-513 (2010) - [j76]Camino Balbuena, Miguel A. Guevara:
Kernels and partial line digraphs. Appl. Math. Lett. 23(10): 1218-1220 (2010) - [j75]Camino Balbuena, Kim Marshall, Luis Pedro Montejano:
On the connectivity and superconnected graphs with small diameter. Discret. Appl. Math. 158(5): 397-403 (2010) - [j74]Encarnación Abajo, Camino Balbuena, Ana Diánez
New families of graphs without short cycles and large size. Discret. Appl. Math. 158(11): 1127-1135 (2010) - [j73]Marién Abreu
Adjacency matrices of polarity graphs and of other C4-free graphs of large size. Des. Codes Cryptogr. 55(2-3): 221-233 (2010) - [j72]Gabriela Araujo-Pardo
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages. Discret. Math. 310(8): 1301-1306 (2010) - [j71]Camino Balbuena
Some properties of semiregular cages. Discret. Math. Theor. Comput. Sci. 12(5): 125-138 (2010) - [j70]Camino Balbuena, Diego González-Moreno
On the connectivity of semiregular cages. Networks 56(1): 81-88 (2010)
2000 – 2009
- 2009
- [j69]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) - [j68]Gabriela Araujo-Pardo, Camino Balbuena, Mika Olsen:
On (k, g; l)-dicages. Ars Comb. 92 (2009) - [j67]Camino Balbuena, Jianmin Tang, Kim Marshall, Yuqing Lin
Superconnectivity of regular graphs with small diameter. Discret. Appl. Math. 157(7): 1349-1353 (2009) - [j66]Camino Balbuena, Diego González-Moreno
On the 3-restricted edge connectivity of permutation graphs. Discret. Appl. Math. 157(7): 1586-1591 (2009) - [j65]Yuqing Lin
On the number of components of (k, g)-cages after vertex deletion. Discret. Appl. Math. 157(8): 1760-1765 (2009) - [j64]Jianmin Tang, Yuqing Lin
Calculating the extremal number ex(v;{C3, C4, ..., Cn}). Discret. Appl. Math. 157(9): 2198-2206 (2009) - [j63]Gabriela Araujo-Pardo
Constructions of bi-regular cages. Discret. Math. 309(6): 1409-1416 (2009) - [j62]Camino Balbuena
A method for obtaining small regular bipartite graphs of girth 8. Discret. Math. Theor. Comput. Sci. 11(2): 33-46 (2009) - [j61]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
- [j60]Camino Balbuena
Diameter-sufficient conditions for a graph to be super-restricted connected. Discret. Appl. Math. 156(15): 2827-2834 (2008) - [j59]Camino Balbuena, Pedro García-Vázquez
Connectivity measures in matched sum graphs. Discret. Math. 308(10): 1985-1993 (2008) - [j58]Gabriela Araujo-Pardo
On the order of ({r, m};g)-cages of even girth. Discret. Math. 308(12): 2484-2491 (2008) - [j57]Yuqing Lin
On the connectivity of (k, g)-cages of even girth. Discret. Math. 308(15): 3249-3256 (2008) - [j56]Camino Balbuena, Martín Cera
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. Discret. Math. 308(16): 3526-3536 (2008) - [j55]Camino Balbuena, Martín Cera
On the girth of extremal graphs without shortest cycles. Discret. Math. 308(23): 5682-5690 (2008) - [j54]Camino Balbuena
Extremal K(s, t)-free Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j53]Camino Balbuena
Conditional diameter saturated graphs. Networks 52(4): 196-201 (2008) - [j52]Camino Balbuena:
Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices. SIAM J. Discret. Math. 22(4): 1351-1363 (2008) - 2007
- [j51]Camino Balbuena, Pedro García-Vázquez
Trees having an even or quasi even degree sequence are graceful. Appl. Math. Lett. 20(4): 370-375 (2007) - [j50]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Extremal bipartite graphs with high girth. Ars Comb. 83 (2007) - [j49]Camino Balbuena
A sufficient condition for Pk-path graphs being r-connected. Discret. Appl. Math. 155(13): 1745-1751 (2007) - [j48]Camino Balbuena
Edge-connectivity and edge-superconnectivity in sequence graphs. Discret. Appl. Math. 155(16): 2053-2060 (2007) - [j47]Camino Balbuena, Martín Cera
On the edge-connectivity and restricted edge-connectivity of a product of graphs. Discret. Appl. Math. 155(18): 2444-2455 (2007) - [j46]Camino Balbuena, Martín Cera
Connectivity of graphs with given girth pair. Discret. Math. 307(2): 155-162 (2007) - [j45]Camino Balbuena, Martín Cera
On the restricted connectivity and superconnectivity in graphs with given girth. Discret. Math. 307(6): 659-667 (2007) - [j44]Camino Balbuena
Counterexample to a conjecture of Györi on C2l-free bipartite graphs. Discret. Math. 307(6): 748-749 (2007) - [j43]Camino Balbuena, Martín Cera
New exact values of the maximum size of graphs free of topological complete subgraphs. Discret. Math. 307(9-10): 1038-1046 (2007) - [j42]Camino Balbuena, Xavier Marcote:
Lower connectivities of regular graphs with small diameter. Discret. Math. 307(11-12): 1255-1265 (2007) - [j41]Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo
On the connectivity of cages with girth five, six and eight. Discret. Math. 307(11-12): 1441-1446 (2007) - [j40]Camino Balbuena, Pedro García-Vázquez
New results on the Zarankiewicz problem. Discret. Math. 307(17-18): 2322-2327 (2007) - [j39]Camino Balbuena, T. Jiang, Yuqing Lin
A lower bound on the order of regular graphs with given girth pair. J. Graph Theory 55(2): 153-163 (2007) - [j38]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) - [c1]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 - 2006
- [j37]Camino Balbuena, Ewan Barker, Kinkar Chandra Das, Yuqing Lin
On the degrees of a strongly vertex-magic graph. Discret. Math. 306(6): 539-551 (2006) - [j36]Camino Balbuena
Consecutive magic graphs. Discret. Math. 306(16): 1817-1829 (2006) - [j35]Camino Balbuena, Gabriela Araujo-Pardo
On the order of bi-regular cages of even girth. Electron. Notes Discret. Math. 26: 1-7 (2006) - [j34]Pedro García-Vázquez
On extremal bipartite graphs with high girth. Electron. Notes Discret. Math. 26: 67-73 (2006) - [j33]Xavier Marcote, Camino Balbuena, Pedro García-Vázquez
Highly connected star product graphs. Electron. Notes Discret. Math. 26: 91-96 (2006) - [j32]Juan Carlos Valenzuela
Extremal K(s, t)-free bipartite graphs. Electron. Notes Discret. Math. 26: 139-144 (2006) - [j31]Camino Balbuena, Pedro García-Vázquez
Sufficient conditions for lambda'-optimality in graphs with girth g. J. Graph Theory 52(1): 73-86 (2006) - [j30]Yuqing Lin
All (k;g)-cages are edge-superconnected. Networks 47(2): 102-110 (2006) - [j29]Camino Balbuena, Pedro García-Vázquez
Reliability of interconnection networks modeled by a product of graphs. Networks 48(3): 114-120 (2006) - 2005
- [j28]Yuqing Lin
Improved lower bound for the vertex connectivity of (delta;;g)-cages. Discret. Math. 299(1-3): 162-171 (2005) - [j27]Xavier Marcote, Camino Balbuena
(delta, g)-cages with g geq 10 are 4-connected. Discret. Math. 301(1): 124-136 (2005) - [j26]Camino Balbuena, Martín Cera
Sufficient conditions for lambda'-optimality of graphs with small conditional diameter. Inf. Process. Lett. 95(4): 429-434 (2005) - [j25]Camino Balbuena
Diameter vulnerability of iterated line digraphs in terms of the girth. Networks 45(2): 49-54 (2005) - [j24]Xavier Marcote, Camino Balbuena
Connectedness of digraphs and graphs under constraints on the conditional diameter. Networks 45(2): 80-87 (2005) - [j23]Camino Balbuena, Xavier Marcote, Pedro García-Vázquez
On restricted connectivities of permutation graphs. Networks 45(3): 113-118 (2005) - 2004
- [j22]Camino Balbuena, Pedro García-Vázquez
Edge-connectivity in Pk-path graphs. Discret. Math. 286(3): 213-218 (2004) - [j21]Xavier Marcote, Camino Balbuena
Diameter, short paths and superconnectivity in digraphs. Discret. Math. 288(1-3): 113-123 (2004) - [j20]Xavier Marcote, Camino Balbuena:
Edge-superconnectivity of cages. Networks 43(1): 54-59 (2004) - 2003
- [j19]José Gómez, Ignacio M. Pelayo
Diameter vulnerability of GC graphs. Discret. Appl. Math. 130(3): 395-416 (2003) - [j18]Xavier Marcote, Ignacio M. Pelayo
Every cubic cage is quasi 4-connected. Discret. Math. 266(1-3): 311-320 (2003) - [j17]Ignacio M. Pelayo
Using a progressive withdrawal procedure to study superconnectivity in digraphs. Discret. Math. 267(1-3): 229-246 (2003) - [j16]Camino Balbuena
Edge-connectivity and super edge-connectivity of P2-path graphs. Discret. Math. 269(1-3): 13-20 (2003) - [j15]Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo:
Algebraic properties of a digraph and its line digraph. J. Interconnect. Networks 4(4): 377-393 (2003) - 2002
- [j14]Camino Balbuena, Ignacio M. Pelayo, José Gómez:
On the superconnectivity of generalized p-cycles. Discret. Math. 255(1-3): 13-23 (2002) - [j13]Camino Balbuena, Josep Fàbrega
Superconnected digraphs and graphs with small conditional diameters. Networks 39(3): 153-160 (2002) - 2001
- [j12]Ignacio M. Pelayo, Camino Balbuena, José Gómez:
On the connectivity of generalized p-cycles. Ars Comb. 58 (2001) - [j11]Camino Balbuena, Ángeles Carmona:
On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs. Ars Comb. 61 (2001) - [j10]Camino Balbuena:
Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence. Electron. Notes Discret. Math. 10: 13-16 (2001) - [j9]Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena:
Every Cubic Cage is quasi 4-connected. Electron. Notes Discret. Math. 10: 216-219 (2001)
1990 – 1999
- 1999
- [j8]Camino Balbuena:
Extraconnectivity of s-geodetic digraphs and graphs. Discret. Math. 195(1-3): 39-52 (1999) - [j7]Camino Balbuena, Ángeles Carmona, Josep Fàbrega
Superconnectivity of bipartite digraphs and graphs. Discret. Math. 197-198: 61-75 (1999) - [j6]José Gómez, Ignacio M. Pelayo, Camino Balbuena:
New large graphs with given degree and diameter six. Networks 34(2): 154-161 (1999) - 1997
- [j5]Camino Balbuena, Ángeles Carmona, Josep Fàbrega
Extraconnectivity of graphs with large minimum degree and girth. Discret. Math. 167-168: 85-100 (1997) - [j4]M. C. Balbuena, Ángeles Carmona, Josep Fàbrega
Connectivity of large bipartite digraphs and graphs. Discret. Math. 174(1-3): 3-17 (1997) - [j3]M. C. Balbuena, Ángeles Carmona, Josep Fàbrega
On the order and size of s-geodetic digraphs with given connectivity. Discret. Math. 174(1-3): 19-27 (1997) - 1996
- [j2]M. C. Balbuena, Ángeles Carmona, Miguel Angel Fiol:
Distance connectivity in graphs and digraphs. J. Graph Theory 22(4): 281-292 (1996) - [j1]Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol:
On the connectivity and the conditional diameter of graphs and digraphs. Networks 28(2): 97-105 (1996) - 1995
- [b1]Camino Balbuena:
Estudio sobre algunas nuevas clases de conectividad condicional en grafos dirigidos. Polytechnic University of Catalonia, Spain, 1995
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-10-07 21:25 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: