default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXavier Marcote
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j44]Camino Balbuena
, Xavier Marcote:
The p-restricted edge-connectivity of Kneser graphs. Appl. Math. Comput. 343: 258-267 (2019)- [j43]Encarnación Abajo, Camino Balbuena, Manuel Bendala, Xavier Marcote:
Improving bounds on the order of regular graphs of girth 5. Discret. Math. 342(10): 2900-2910 (2019) - 2013
- [j42]Camino Balbuena, Xavier Marcote:
The k-restricted edge-connectivity of a product of graphs. Discret. Appl. Math. 161(1-2): 52-59 (2013) - [j41]Hongliang Lu, Yunjian Wu, Yuqing Lin, Qinglin Yu, Camino Balbuena, Xavier Marcote:
On Superconnectivity of (4, g)-Cages. Graphs Comb. 29(1): 105-119 (2013) - 2011
- [j40]Camino Balbuena, Xavier Marcote:
Monotonicity of the order of (D;g)-cages. Appl. Math. Lett. 24(11): 1933-1937 (2011) - [j39]Camino Balbuena, Xavier Marcote:
Diameter and connectivity of (D; g)-cages. Int. J. Comput. Math. 88(7): 1387-1397 (2011) - 2010
- [j38]Camino Balbuena, Xavier Marcote, Diego González-Moreno:
Some properties of semiregular cages. Discret. Math. Theor. Comput. Sci. 12(5): 125-138 (2010) - [j37]Camino Balbuena, Diego González-Moreno, Xavier Marcote:
On the connectivity of semiregular cages. Networks 56(1): 81-88 (2010)
2000 – 2009
- 2009
- [j36]Camino Balbuena, Diego González-Moreno, Xavier Marcote:
On the 3-restricted edge connectivity of permutation graphs. Discret. Appl. Math. 157(7): 1586-1591 (2009) - 2008
- [j35]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Connectivity measures in matched sum graphs. Discret. Math. 308(10): 1985-1993 (2008) - [j34]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. Discret. Math. 308(12): 2484-2491 (2008) - [j33]Yuqing Lin, Camino Balbuena, Xavier Marcote, Mirka Miller:
On the connectivity of (k, g)-cages of even girth. Discret. Math. 308(15): 3249-3256 (2008) - [j32]Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. Discret. Math. 308(16): 3526-3536 (2008) - [j31]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Extremal K(s, t)-free Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j30]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Conditional diameter saturated graphs. Networks 52(4): 196-201 (2008) - 2007
- [j29]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) - [j28]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Extremal bipartite graphs with high girth. Ars Comb. 83 (2007) - [j27]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. Discret. Appl. Math. 155(18): 2444-2455 (2007) - [j26]Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
Connectivity of graphs with given girth pair. Discret. Math. 307(2): 155-162 (2007) - [j25]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. Discret. Math. 307(6): 659-667 (2007) - [j24]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Counterexample to a conjecture of Györi on C2l-free bipartite graphs. Discret. Math. 307(6): 748-749 (2007) - [j23]Camino Balbuena, Xavier Marcote:
Lower connectivities of regular graphs with small diameter. Discret. Math. 307(11-12): 1255-1265 (2007) - [j22]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) - [j21]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
New results on the Zarankiewicz problem. Discret. Math. 307(17-18): 2322-2327 (2007) - [j20]Camino Balbuena, T. Jiang, Yuqing Lin, Xavier Marcote, Mirka Miller:
A lower bound on the order of regular graphs with given girth pair. J. Graph Theory 55(2): 153-163 (2007) - 2006
- [j19]Camino Balbuena, Gabriela Araujo-Pardo, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
On the order of bi-regular cages of even girth. Electron. Notes Discret. Math. 26: 1-7 (2006) - [j18]Pedro García-Vázquez, Camino Balbuena, Xavier Marcote, Juan Carlos Valenzuela:
On extremal bipartite graphs with high girth. Electron. Notes Discret. Math. 26: 67-73 (2006) - [j17]Xavier Marcote, Camino Balbuena, Pedro García-Vázquez, Juan Carlos Valenzuela:
Highly connected star product graphs. Electron. Notes Discret. Math. 26: 91-96 (2006) - [j16]Juan Carlos Valenzuela, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Extremal K(s, t)-free bipartite graphs. Electron. Notes Discret. Math. 26: 139-144 (2006) - [j15]Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
Sufficient conditions for lambda'-optimality in graphs with girth g. J. Graph Theory 52(1): 73-86 (2006) - [j14]Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote:
All (k;g)-cages are edge-superconnected. Networks 47(2): 102-110 (2006) - [j13]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
- [j12]Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega:
(delta, g)-cages with g geq 10 are 4-connected. Discret. Math. 301(1): 124-136 (2005) - [j11]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) - [j10]Camino Balbuena, Xavier Marcote, Daniela Ferrero:
Diameter vulnerability of iterated line digraphs in terms of the girth. Networks 45(2): 49-54 (2005) - [j9]Xavier Marcote, Camino Balbuena, Josep Fàbrega:
Connectedness of digraphs and graphs under constraints on the conditional diameter. Networks 45(2): 80-87 (2005) - [j8]Camino Balbuena, Xavier Marcote, Pedro García-Vázquez:
On restricted connectivities of permutation graphs. Networks 45(3): 113-118 (2005) - 2004
- [j7]Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo:
Diameter, short paths and superconnectivity in digraphs. Discret. Math. 288(1-3): 113-123 (2004) - [j6]Xavier Marcote, Camino Balbuena:
Edge-superconnectivity of cages. Networks 43(1): 54-59 (2004) - 2003
- [j5]Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena:
Every cubic cage is quasi 4-connected. Discret. Math. 266(1-3): 311-320 (2003) - [j4]Ignacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega:
Using a progressive withdrawal procedure to study superconnectivity in digraphs. Discret. Math. 267(1-3): 229-246 (2003) - [j3]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
- [j2]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
- [j1]Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena:
Every Cubic Cage is quasi 4-connected. Electron. Notes Discret. Math. 10: 216-219 (2001)
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-04-25 05:55 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:
