Josep Fàbrega

发表

Edge-Bisection of Chordal Rings

Lali Barrière, Josep Fàbrega, 2000, MFCS.

Extraconnectivity of graphs with large girth

Miguel Angel Fiol, Josep Fàbrega, M. A. Fiol, 1994, Discret. Math..

On the connectivity and the conditional diameter of graphs and digraphs

Miguel Angel Fiol, Camino Balbuena, Josep Fàbrega, 1996, Networks.

Bipartite Graphs and Digraphs with Maximum Connectivity

Miguel Angel Fiol, Josep Fàbrega, 1996, Discret. Appl. Math..

Using a progressive withdrawal procedure to study superconnectivity in digraphs

Camino Balbuena, Xavier Marcote, Josep Fàbrega, 2003, Discret. Math..

Edge-distance-regular graphs

Miguel Angel Fiol, Josep Fàbrega, Cristina Dalfó, 2011, Electron. Notes Discret. Math..

Online Matching in Regular Bipartite Graphs with Randomized Adversary

Josep Fàbrega, Xavier Muñoz, 2018, Adventures Between Lower Bounds and Higher Altitudes.

A Study of Network Capacity under Deflection Routing Schemes

Josep Fàbrega, Xavier Muñoz, 2003, Euro-Par.

Superconnected digraphs and graphs with small conditional diameters

Camino Balbuena, Xavier Marcote, Josep Fàbrega, 2002, Networks.

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

Miguel Angel Fiol, Josep Fàbrega, Ernest Garriga, 2012, Discret. Appl. Math..

Connectivity of large bipartite digraphs and graphs

Miguel Angel Fiol, Camino Balbuena, Josep Fàbrega, 1997, Discret. Math..

Maximally connected digraphs

Miguel Angel Fiol, Josep Fàbrega, M. A. Fiol, 1989, J. Graph Theory.

(delta, G)-cages with G Geq 10 Are 4-connected

Camino Balbuena, Xavier Marcote, Josep Fàbrega, 2005, Discret. Math..

On the extraconnectivity of graphs

Miguel Angel Fiol, Josep Fàbrega, M. A. Fiol, 1996, Discret. Math..

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

Miguel Angel Fiol, Josep Fàbrega, Oriol Serra, 1993, Parallel Process. Lett..

Superconnectivity of bipartite digraphs and graphs

Miguel Angel Fiol, Camino Balbuena, Josep Fàbrega, 1999, Discret. Math..

Edge-distance-regular graphs

Miguel Angel Fiol, Josep Fàbrega, Cristina Dalfó, 2011, Electron. Notes Discret. Math..

Fault-tolerant Routings in Double Fixed-step Networks

Josep Fàbrega, Marisa Zaragozá, J. Fàbrega, 1997, Discret. Appl. Math..

Connectedness of digraphs and graphs under constraints on the conditional diameter

Camino Balbuena, Xavier Marcote, Josep Fàbrega, 2005, Networks.

Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes

Miguel Angel Fiol, Josep Fàbrega, Ernest Garriga, 2010, Electron. J. Comb..

On the distance connectivity of graphs and digraphs

Miguel Angel Fiol, Josep Fàbrega, 1994, Discret. Math..

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

Miguel Angel Fiol, Camino Balbuena, Josep Fàbrega, 1997, Discret. Math..

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

Miguel Angel Fiol, Josep Fàbrega, Ernest Garriga, 2009, Electron. J. Comb..

On the superconnectivity and the conditional diameter of graphs and digraphs

Josep Fàbrega, Ángeles Carmona, 1999, Networks.

Fault-tolerant routings in chordal ring networks

Lali Barrière, Josep Fàbrega, Marisa Zaragozá, 2000, Networks.

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

Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz, 2016, Electron. Notes Discret. Math..

On large (Δ, D, D, 1)‐graphs

Josep Fàbrega, José Gómez, José Luis Andres Yebra, 2011, Networks.

Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010

Josep Fàbrega, Josef Širáň, Josep M. Brunat Blay, 2011 .

Extraconnectivity of graphs with large minimum degree and girth

Miguel Angel Fiol, Camino Balbuena, Josep Fàbrega, 1997, Discret. Math..

Edge-connectivity and edge-superconnectivity in sequence graphs

Camino Balbuena, Pedro García-Vázquez, Josep Fàbrega, 2007, Discret. Appl. Math..