The following publications are possibly variants of this publication:
- On the Connectivity and Superconnectivity of Bipartite Digraphs and GraphsCamino Balbuena, Angeles Carmona. arscom, 61, 2001.
- The superconnectivity of large digraphs and graphsMiguel Angel Fiol. DM, 124(1-3):67-78, 1994. [doi]
- On the superconnectivity and the conditional diameter of graphs and digraphsAngeles Carmona, Josep Fàbrega. networks, 34(3):197-205, 1999. [doi]
- Diameter, short paths and superconnectivity in digraphsXavier Marcote, Camino Balbuena, Ignacio M. Pelayo. DM, 288(1-3):113-123, 2004. [doi]
- Bipartite Graphs and Digraphs with Maximum ConnectivityJosep Fàbrega, Miguel Angel Fiol. DAM, 69(3):271-279, 1996. [doi]
- Connectivity of large bipartite digraphs and graphsM. C. Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol. DM, 174(1-3):3-17, 1997. [doi]
- Using a progressive withdrawal procedure to study superconnectivity in digraphsIgnacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega. DM, 267(1-3):229-246, 2003. [doi]
- Superconnectivity of regular graphs with small diameterCamino Balbuena, Jianmin Tang, Kim Marshall, Yuqing Lin. DAM, 157(7):1349-1353, 2009. [doi]