Xavier Marcote

Orcid: 0000-0002-5194-8593

According to our database1, Xavier Marcote authored at least 42 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Improving bounds on the order of regular graphs of girth 5.
Discret. Math., 2019

The <i>p</i>-restricted edge-connectivity of Kneser graphs.
Appl. Math. Comput., 2019

2013
On Superconnectivity of (4, g)-Cages.
Graphs Comb., 2013

The k-restricted edge-connectivity of a product of graphs.
Discret. Appl. Math., 2013

2011
Diameter and connectivity of (<i>D; g</i>)-cages.
Int. J. Comput. Math., 2011

Monotonicity of the order of (D;g)-cages.
Appl. Math. Lett., 2011

2010
On the connectivity of semiregular cages.
Networks, 2010

Some properties of semiregular cages.
Discret. Math. Theor. Comput. Sci., 2010

2009
On the 3-restricted edge connectivity of permutation graphs.
Discret. Appl. Math., 2009

2008
Conditional diameter saturated graphs.
Networks, 2008

Extremal K(s, t)-free Bipartite Graphs.
Discret. Math. Theor. Comput. Sci., 2008

On the connectivity of (k, g)-cages of even girth.
Discret. Math., 2008

Connectivity measures in matched sum graphs.
Discret. Math., 2008

Diameter-girth sufficient conditions for optimal extraconnectivity in graphs.
Discret. Math., 2008

On the order of ({r, m};g)-cages of even girth.
Discret. Math., 2008

2007
A lower bound on the order of regular graphs with given girth pair.
J. Graph Theory, 2007

On the connectivity of cages with girth five, six and eight.
Discret. Math., 2007

Lower connectivities of regular graphs with small diameter.
Discret. Math., 2007

New results on the Zarankiewicz problem.
Discret. Math., 2007

Counterexample to a conjecture of Györi on C<sub>2l</sub>-free bipartite graphs.
Discret. Math., 2007

On the restricted connectivity and superconnectivity in graphs with given girth.
Discret. Math., 2007

Connectivity of graphs with given girth pair.
Discret. Math., 2007

On the edge-connectivity and restricted edge-connectivity of a product of graphs.
Discret. Appl. Math., 2007

Trees having an even or quasi even degree sequence are graceful.
Appl. Math. Lett., 2007

2006
All (<i>k</i>;<i>g</i>)-cages are edge-superconnected.
Networks, 2006

Reliability of interconnection networks modeled by a product of graphs.
Networks, 2006

Sufficient conditions for lambda'-optimality in graphs with girth <i>g</i>.
J. Graph Theory, 2006

Extremal K<sub>(s, t)</sub>-free bipartite graphs.
Electron. Notes Discret. Math., 2006

Highly connected star product graphs.
Electron. Notes Discret. Math., 2006

On extremal bipartite graphs with high girth.
Electron. Notes Discret. Math., 2006

On the order of bi-regular cages of even girth.
Electron. Notes Discret. Math., 2006

2005
Connectedness of digraphs and graphs under constraints on the conditional diameter.
Networks, 2005

On restricted connectivities of permutation graphs.
Networks, 2005

Diameter vulnerability of iterated line digraphs in terms of the girth.
Networks, 2005

Sufficient conditions for <i>lambda</i><sup>'</sup>-optimality of graphs with small conditional diameter.
Inf. Process. Lett., 2005

(<i>delta</i>, <i>g</i>)-cages with <i>g</i> geq 10 are 4-connected.
Discret. Math., 2005

2004
Edge-superconnectivity of cages.
Networks, 2004

Diameter, short paths and superconnectivity in digraphs.
Discret. Math., 2004

2003
Algebraic properties of a digraph and its line digraph.
J. Interconnect. Networks, 2003

Using a progressive withdrawal procedure to study superconnectivity in digraphs.
Discret. Math., 2003

2002
Superconnected digraphs and graphs with small conditional diameters.
Networks, 2002

2001
Every Cubic Cage is quasi 4-connected.
Electron. Notes Discret. Math., 2001


  Loading...