Pelayo, I.; Marcote, X.; Balbuena, C.; Fàbrega, J. Using a progressive withdrawal procedure to study superconnectivity in digraphs. (English) Zbl 1025.05038 Discrete Math. 267, No. 1-3, 229-246 (2003). Reviewer: F.Gliviak (Bratislava) MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{I. Pelayo} et al., Discrete Math. 267, No. 1--3, 229--246 (2003; Zbl 1025.05038) Full Text: DOI
Balbuena, C.; Fàbrega, J.; Marcote, X.; Pelayo, I. Superconnected digraphs and graphs with small conditional diameters. (English) Zbl 0999.05048 Networks 39, No. 3, 153-160 (2002). Reviewer: F.Gliviak (Bratislava) MSC: 05C20 05C40 05C12 PDFBibTeX XMLCite \textit{C. Balbuena} et al., Networks 39, No. 3, 153--160 (2002; Zbl 0999.05048) Full Text: DOI
Carmona, A.; Fàbrega, J. On the superconnectivity and the conditional diameter of graphs and digraphs. (English) Zbl 0984.05052 Networks 34, No. 3, 197-205 (1999). MSC: 05C40 PDFBibTeX XMLCite \textit{A. Carmona} and \textit{J. Fàbrega}, Networks 34, No. 3, 197--205 (1999; Zbl 0984.05052) Full Text: DOI
Balbuena, C.; Carmona, A.; Fàbrega, J.; Fiol, M. A. Superconnectivity of bipartite digraphs and graphs. (English) Zbl 0933.05089 Discrete Math. 197-198, 61-75 (1999). Reviewer: F.Gliviak (Bratislava) MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{C. Balbuena} et al., Discrete Math. 197--198, 61--75 (1999; Zbl 0933.05089) Full Text: DOI
Balbuena, M. C.; Carmona, A.; Fàbrega, J.; Fiol, M. A. Connectivity of large bipartite digraphs and graphs. (English) Zbl 0886.05085 Discrete Math. 174, No. 1-3, 3-17 (1997). Reviewer: Ján Plesník (Bratislava) MSC: 05C40 05C20 05C12 PDFBibTeX XMLCite \textit{M. C. Balbuena} et al., Discrete Math. 174, No. 1--3, 3--17 (1997; Zbl 0886.05085) Full Text: DOI
Balbuena, M. C.; Carmona, A.; Fàbrega, J.; Fiol, M. A. On the order and size of \(s\)-geodetic digraphs with given connectivity. (English) Zbl 0886.05086 Discrete Math. 174, No. 1-3, 19-27 (1997). Reviewer: Ján Plesník (Bratislava) MSC: 05C40 05C20 05C12 PDFBibTeX XMLCite \textit{M. C. Balbuena} et al., Discrete Math. 174, No. 1--3, 19--27 (1997; Zbl 0886.05086) Full Text: DOI
Fàbrega, J.; Fiol, M. A. Bipartite graphs and digraphs with maximum connectivity. (English) Zbl 0857.05063 Discrete Appl. Math. 69, No. 3, 271-279 (1996). Reviewer: Ján Plesník (Bratislava) MSC: 05C40 05C20 05C12 PDFBibTeX XMLCite \textit{J. Fàbrega} and \textit{M. A. Fiol}, Discrete Appl. Math. 69, No. 3, 271--279 (1996; Zbl 0857.05063) Full Text: DOI
Escudero, M.; Fabrega, J.; Fiol, M. A.; Homobono, N. On surviving route graphs of iterated line digraphs. (English) Zbl 0841.05037 Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication. 451-466 (1991). MSC: 05C20 PDFBibTeX XMLCite \textit{M. Escudero} et al., in: Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley \&| Sons Ltd.. 451--466 (1991; Zbl 0841.05037)
Fiol, M. A.; Fàbrega, J.; Escudero, M. Short paths and connectivity in graphs and digraphs. (English) Zbl 0708.05025 Ars Comb. 29B, 17-31 (1990). Reviewer: R.C.Entringer MSC: 05C20 05C38 05C40 PDFBibTeX XMLCite \textit{M. A. Fiol} et al., Ars Comb. 29B, 17--31 (1990; Zbl 0708.05025)