Maximally connected digraphs. - Josep Fàbrega; Miguel Angel Fiol (J. Graph Theory, 1989)

A Unified Approach to the design and Control of Dynamic Memory Networks. - Miguel Angel Fiol; Josep Fàbrega; Oriol Serra; J. Luis A. Yebra (Parallel Process. Lett., 1993)

Extraconnectivity of graphs with large girth. - Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1994)

On the distance connectivity of graphs and digraphs. - Miguel Angel Fiol; Josep Fàbrega (Discret. Math., 1994)

Bipartite Graphs and Digraphs with Maximum Connectivity. - Josep Fàbrega; Miguel Angel Fiol (Discret. Appl. Math., 1996)

On the extraconnectivity of graphs. - Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1996)

On the connectivity and the conditional diameter of graphs and digraphs. - Camino Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Networks, 1996)

Fault-tolerant Routings in Double Fixed-step Networks. - Josep Fàbrega; Marisa Zaragozá (Discret. Appl. Math., 1997)

Connectivity of large bipartite digraphs and graphs. - M. C. Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1997)

On the order and size of s-geodetic digraphs with given connectivity. - M. C. Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1997)

Extraconnectivity of graphs with large minimum degree and girth. - Camino Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1997)

Superconnectivity of bipartite digraphs and graphs. - Camino Balbuena; Ángeles Carmona; Josep Fàbrega; Miguel Angel Fiol (Discret. Math., 1999)

On the superconnectivity and the conditional diameter of graphs and digraphs. - Ángeles Carmona; Josep Fàbrega (Networks, 1999)

Edge-Bisection of Chordal Rings. - Lali Barrière; Josep Fàbrega (MFCS, 2000)

Fault-tolerant routings in chordal ring networks. - Lali Barrière; Josep Fàbrega; Ester Simó; Marisa Zaragozá (Networks, 2000)

Superconnected digraphs and graphs with small conditional diameters. - Camino Balbuena; Josep Fàbrega; Xavier Marcote; Ignacio M. Pelayo (Networks, 2002)

Connectivity and Traversability. - Josep Fàbrega; Miguel Angel Fiol; Herbert Fleischner; R. Gary Parker; A Dewdney; Ronald J. Gould; Gregory Z. Gutin (Handbook of Graph Theory, 2003)

A Study of Network Capacity under Deflection Routing Schemes. - Josep Fàbrega; Xavier Muñoz (Euro-Par, 2003)

Using a progressive withdrawal procedure to study superconnectivity in digraphs. - Ignacio M. Pelayo; Xavier Marcote; Camino Balbuena; Josep Fàbrega (Discret. Math., 2003)

(delta, g)-cages with g geq 10 are 4-connected. - Xavier Marcote; Camino Balbuena; Ignacio M. Pelayo; Josep Fàbrega (Discret. Math., 2005)

Connectedness of digraphs and graphs under constraints on the conditional diameter. - Xavier Marcote; Camino Balbuena; Josep Fàbrega (Networks, 2005)

Edge-connectivity and edge-superconnectivity in sequence graphs. - Camino Balbuena; Josep Fàbrega; Pedro García-Vázquez (Discret. Appl. Math., 2007)

Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes. - Marc Cámara; Josep Fàbrega; Miguel Angel Fiol; Ernest Garriga (Electron. J. Comb., 2009)

Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes. - Marc Cámara; Josep Fàbrega; Miguel Angel Fiol; Ernest Garriga (Electron. J. Comb., 2010)

Edge-distance-regular graphs. - Marc Cámara; Cristina Dalfó; Josep Fàbrega; Miguel Angel Fiol; Ernest Garriga (J. Comb. Theory A, 2011)

On large (Δ, D, D, 1)-graphs. - José Gómez; Josep Fàbrega; José Luis Andres Yebra (Networks, 2011)

On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes. - Marc Cámara; Josep Fàbrega; Miguel Angel Fiol; Ernest Garriga (Discret. Appl. Math., 2014)

Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing. - Josep Fàbrega; Jaume Martí-Farré; Xavier Muñoz (Electron. Notes Discret. Math., 2016)

Online Matching in Regular Bipartite Graphs with Randomized Adversary. - Josep Fàbrega; Xavier Muñoz (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Uniform forcing and immune sets in graphs and hypergraphs. - Josep Fàbrega; Jaume Martí-Farré; Xavier Muñoz (Discret. Appl. Math., 2021)

Immune sets in monotone infection rules. Characterization and complexity. - Josep Fàbrega; Jaume Martí-Farré; Xavier Muñoz (Discret. Appl. Math., 2023)

Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing. - Josep Fàbrega; Jaume Martí-Farré; Xavier Muñoz (Networks, 2023)

On the size of immune sets in the k-PULL infection model. - Josep Fàbrega; Xavier Marcote; Xavier Muñoz (Discret. Appl. Math., 2025)