| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | E. Abajo, Camino Balbuena, Ana Diánez |
Girth of {C3, ..., Cs}-free extremal graphs.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, A. Hansberg, Luis Pedro Montejano |
Restricted arc-connectivity of generalized p-cycles.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian Salas, Camino Balbuena |
New results on connectivity of cages.  |
Electronic Notes in Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Diego González-Moreno, Julian Salas |
Edge-superconnectivity of semiregular cages with odd girth.  |
Networks  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela Araujo-Pardo, Camino Balbuena |
Constructions of small regular bipartite graphs of girth 6.  |
Networks  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela Araujo-Pardo, Camino Balbuena, Luis Pedro Montejano, Juan Carlos Valenzuela |
Partial linear spaces and identifying codes.  |
Eur. J. Comb.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano, Julian Salas |
On the λ′-optimality in graphs with odd girth g and even girth h.  |
Appl. Math. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Xavier Marcote |
Monotonicity of the order of (D;g)-cages.  |
Appl. Math. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano |
Superconnectivity of graphs with odd girth g and even girth h.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Xavier Marcote |
Diameter and connectivity of (D; g)-cages.  |
Int. J. Comput. Math.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela Araujo-Pardo, Camino Balbuena, T. Héger |
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages.  |
Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Xavier Marcote, Diego González-Moreno |
Some properties of semiregular cages.  |
Discrete Mathematics & Theoretical Computer Science  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Camino Balbuena, Diego González-Moreno, Xavier Marcote |
On the connectivity of semiregular cages.  |
Networks  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, M. Guevara |
Kernels and partial line digraphs.  |
Appl. Math. Lett.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez |
Edge fault tolerance analysis of super k-restricted connected networks.  |
Applied Mathematics and Computation  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Kim Marshall, Luis Pedro Montejano |
On the connectivity and superconnected graphs with small diameter.  |
Discrete Applied Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | E. Abajo, Camino Balbuena, Ana Diánez |
New families of graphs without short cycles and large size.  |
Discrete Applied Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marien Abreu, Camino Balbuena, Domenico Labbate |
Adjacency matrices of polarity graphs and of other C4-free graphs of large size.  |
Des. Codes Cryptography  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Pedro Montejano, Camino Balbuena, Pedro García-Vázquez |
On the Superconnectivity in graphs with odd girth g and even girth h.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela Araujo-Pardo, Camino Balbuena, Juan Carlos Valenzuela |
Constructions of bi-regular cages.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena |
A method for obtaining small regular bipartite graphs of girth 8.  |
Discrete Mathematics & Theoretical Computer Science  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Camino Balbuena, M. I. Ortego |
The distribution of extremes in the degree sequence: A Gumbel distribution approach.  |
Appl. Math. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Jianmin Tang, Kim Marshall, Yuqing Lin |
Superconnectivity of regular graphs with small diameter.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianmin Tang, Yuqing Lin, Camino Balbuena, Mirka Miller |
Calculating the extremal number ex(v;{C3, C4, ..., Cn}).  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Diego González-Moreno, Xavier Marcote |
On the 3-restricted edge connectivity of permutation graphs.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuqing Lin, Camino Balbuena, Mirka Miller |
On the number of components of (k, g)-cages after vertex deletion.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuqing Lin, Camino Balbuena, Xavier Marcote, Mirka Miller |
On the connectivity of (k, g)-cages of even girth.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Xavier Marcote |
Connectivity measures in matched sum graphs.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez |
On the girth of extremal graphs without shortest cycles.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela |
Extremal K(s, t)-free Bipartite Graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela |
Conditional diameter saturated graphs.  |
Networks  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena |
Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices.  |
SIAM J. Discrete Math.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Yuqing Lin, Mirka Miller |
Diameter-sufficient conditions for a graph to be super-restricted connected.  |
Discrete Applied Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo |
On the connectivity of cages with girth five, six and eight.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote |
Connectivity of graphs with given girth pair.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela |
New results on the Zarankiewicz problem.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Xavier Marcote |
Lower connectivities of regular graphs with small diameter.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez |
On the Minimum Order of Extremal Graphs to have a Prescribed Girth.  |
SIAM J. Discrete Math.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez |
A sufficient condition for Pk-path graphs being r-connected.  |
Discrete Applied Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez |
Edge-connectivity and edge-superconnectivity in sequence graphs.  |
Discrete Applied Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela |
Extremal bipartite graphs with high girth.  |
Ars Comb.  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jianmin Tang, Camino Balbuena, Yuqing Lin, Mirka Miller |
An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected.  |
CATS  |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan Carlos Valenzuela, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote |
Extremal K(s, t)-free bipartite graphs.  |
Electronic Notes in Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Marcote, Camino Balbuena, Pedro García-Vázquez, Juan Carlos Valenzuela |
Highly connected star product graphs.  |
Electronic Notes in Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedro García-Vázquez, Camino Balbuena, Xavier Marcote, Juan Carlos Valenzuela |
On extremal bipartite graphs with high girth.  |
Electronic Notes in Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, E. Barker, Yuqing Lin, Mirka Miller, Kiki A. Sugeng |
Consecutive magic graphs.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote |
All (k;g)-cages are edge-superconnected.  |
Networks  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Xavier Marcote |
Reliability of interconnection networks modeled by a product of graphs.  |
Networks  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez, Xavier Marcote |
Sufficient conditions for lambda'-optimality in graphs with girth g.  |
Journal of Graph Theory  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuqing Lin, Mirka Miller, Camino Balbuena |
Improved lower bound for the vertex connectivity of (delta;;g)-cages.  |
Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega |
(delta, g)-cages with g geq 10 are 4-connected.  |
Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Marcote, Camino Balbuena, Josep Fàbrega |
Connectedness of digraphs and graphs under constraints on the conditional diameter.  |
Networks  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Xavier Marcote, Daniela Ferrero |
Diameter vulnerability of iterated line digraphs in terms of the girth.  |
Networks  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Xavier Marcote, Pedro García-Vázquez |
On restricted connectivities of permutation graphs.  |
Networks  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo |
Diameter, short paths and superconnectivity in digraphs.  |
Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Pedro García-Vázquez |
Edge-connectivity in Pk-path graphs.  |
Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Marcote, Camino Balbuena |
Edge-superconnectivity of cages.  |
Networks  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ignacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega |
Using a progressive withdrawal procedure to study superconnectivity in digraphs.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Daniela Ferrero |
Edge-connectivity and super edge-connectivity of P2-path graphs.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena |
Every cubic cage is quasi 4-connected.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo |
Algebraic properties of a digraph and its line digraph.  |
Journal of Interconnection Networks  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Gómez, Ignacio M. Pelayo, Camino Balbuena |
Diameter vulnerability of GC graphs.  |
Discrete Applied Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Ignacio M. Pelayo, J. Gómez |
On the superconnectivity of generalized p-cycles.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo |
Superconnected digraphs and graphs with small conditional diameters.  |
Networks  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena |
Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence.  |
Electronic Notes in Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena |
Every Cubic Cage is quasi 4-connected.  |
Electronic Notes in Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ignacio M. Pelayo, Camino Balbuena, J. Gómez |
On the connectivity of generalized p-cycles.  |
Ars Comb.  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Camino Balbuena, Angeles Carmona |
On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs.  |
Ars Comb.  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Camino Balbuena |
Extraconnectivity of s-geodetic digraphs and graphs.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol |
Superconnectivity of bipartite digraphs and graphs.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Gómez, Ignacio M. Pelayo, Camino Balbuena |
New large graphs with given degree and diameter six.  |
Networks  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol |
Extraconnectivity of graphs with large minimum degree and girth.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | M. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol |
Connectivity of large bipartite digraphs and graphs.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol |
On the connectivity and the conditional diameter of graphs and digraphs.  |
Networks  |
1996 |
DBLP DOI BibTeX RDF |
|