Artículos Seleccionados

• A. Carmona and J. Fàbrega, On the superconnectivity and the conditional diameter of graphs and digraphs, Networks 34 (1999) 197-205.
• C. Balbuena, A. Carmona, J. Fàbrega and M.A. Fiol, Superconnectivity of bipartite digraphs and graphs, Discrete Math. 197-198 (1999), no. 1-3, pp. 61-75.
• M.C. Balbuena, A. Carmona, J. Fàbrega and M.A. Fiol, Extraconnectivity of graphs with large minimum degree and girth Discrete Math. 167/168 (1997), no. 1-3, 85-100.
• J. Fàbrega and M. Zaragozá, Fault tolerant routings in double fixed-step networks. Discrete Appl. Math. 78 (1997), no. 1-3, 61-74.
• M.C. Balbuena, A. Carmona, J. Fàbrega and M.A. Fiol, On the connectivity and the conditional diameter of graphs and digraphs, Networks 28 (1996) 97--105.
• J. Fàbrega and M.A. Fiol, On the extraconnectivity of graphs. Discrete Math. 155 (1996), no. 1-3, 49-57.
• M.A. Fiol and J. Fàbrega, On the distance connectivity of graphs and digraphs. Discrete Math. 125 (1994) 169-176.
• M.A. Fiol, J. Fàbrega, O. Serra and J.L.A. Yebra, A unified approach to the design and control of dynamic memory networks. Parallel Processing Letters 3 (1993), no. 4, 445-456.
• M. Escudero, J. Fàbrega, M.A. Fiol and N. Homobono, On surviving route graphs of iterated line digraphs. Graph Theory, Combinatorics and Applications, 1, Ed. Y. Alavi et al., John Wiley, New York, (1992) 451-466.
• J. Fàbrega and M.A. Fiol, Maximally connected digraphs. J. Graph Theory, 13 (1989) 657-668.

Puede consultarse la base de datos de publicaciones del grupo de investigación.