Josep Fàbrega

Networks, December, 2023

Immune sets in monotone infection rules. Characterization and complexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., November, 2023

2021

Uniform forcing and immune sets in graphs and hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2018

Online Matching in Regular Bipartite Graphs with Randomized Adversary.

[BibT_eX]

[DOI]

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016

Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2014

On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2011

On large (Δ, D, D, 1)-graphs.

[BibT_eX]

[DOI]

José Gómez

José Luis Andres Yebra

Networks, 2011

Edge-distance-regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

2010

Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2007

Edge-connectivity and edge-superconnectivity in sequence graphs.

[BibT_eX]

[DOI]

Camino Balbuena

Pedro García-Vázquez

Discret. Appl. Math., 2007

2005

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

[BibT_eX]

[DOI]

Xavier Marcote

Camino Balbuena

Networks, 2005

(delta, g)-cages with g geq 10 are 4-connected.

[BibT_eX]

[DOI]

Discret. Math., 2005

2003

Using a progressive withdrawal procedure to study superconnectivity in digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

A Study of Network Capacity under Deflection Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Connectivity and Traversability.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Superconnected digraphs and graphs with small conditional diameters.

[BibT_eX]

[DOI]

Networks, 2002

2000

Fault-tolerant routings in chordal ring networks.

[BibT_eX]

[DOI]

Networks, 2000

Edge-Bisection of Chordal Rings.

[BibT_eX]

[DOI]

Lali Barrière

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

On the superconnectivity and the conditional diameter of graphs and digraphs.

[BibT_eX]

[DOI]

Ángeles Carmona

Networks, 1999

Superconnectivity of bipartite digraphs and graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

1997

Extraconnectivity of graphs with large minimum degree and girth.

[BibT_eX]

[DOI]

Discret. Math., 1997

On the order and size of s-geodetic digraphs with given connectivity.

[BibT_eX]

[DOI]

Discret. Math., 1997

Connectivity of large bipartite digraphs and graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Fault-tolerant Routings in Double Fixed-step Networks.

[BibT_eX]

[DOI]

Marisa Zaragozá

Discret. Appl. Math., 1997

1996

On the connectivity and the conditional diameter of graphs and digraphs.

[BibT_eX]

[DOI]

Networks, 1996

On the extraconnectivity of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Bipartite Graphs and Digraphs with Maximum Connectivity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1994

On the distance connectivity of graphs and digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

Extraconnectivity of graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

A Unified Approach to the design and Control of Dynamic Memory Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1993

1989

Maximally connected digraphs.

[BibT_eX]

[DOI]