References
- J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, MacMillan Press, London, 1976.
- Y. Dinitz, Algorithm for solution of a problem of maximum flow in a network with power estimation, Soviet Math. Dokl. 11 (1970), pp. 1277–1280.
- Y. Dinitz, Dinitz' Algorithm: The Original Version and Even's Version, Theor. Comput. Sci., Springer Berlin Heidelberg (2006), pp. 218–240.
- Z. Dvořák, J. Kára, D. král', and O. Pangrác, An algorithm for cyclic edge connectivity of cubic graphs, SWAT 2004, LNCS 3111 (2004), pp. 236–247.
- J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, J. Assoc. Comput. Mach. 19 (1972), pp. 248–264. doi: 10.1145/321694.321699
- A.H. Esfahanian and S.L. Hakimi, On computing the connectivities of graphs and digraphs, Networks 14 (1984), pp. 355–366. doi: 10.1002/net.3230140211
- S. Even, Graph Algorithms, Cambridge University Press, New York, 2011.
- S. Even and R.E. Tarjan, Network flow and testing graph connectivity, SIAM J. Comput. 4 (1975), pp. 507–518. doi: 10.1137/0204043
- G. Exoo and R. Jajcay, Dynamic cage survey, Electron. J. Combin., Dynamic Survey DS16 (2008), p. 4.
- Z. Galil, Finding the vertex connectivity of graphs, SIAM J. Comput. 9 (1980), pp. 197–199. doi: 10.1137/0209016
- M.R. Henzinger, S. Rao, and H.N. Gabow, Computing Vertex Connectivity: New Bounds from Old Techniques, Proceedings of 37th IEEE F.O.C.S. (1996), pp. 462–471.
- D. Lou and K. Liang, An improved algorithm for cyclic edge connectivity of regular graphs, Ars Combin. 115 (2014), pp. 315–333.
- D. Lou and W. Wang, An efficient algorithm for cyclic edge connectivity of regular graphs, Ars Combin. 77 (2005), pp. 311–318.
- W.D. McCuaig, Edge reductions in cyclically k-connected cubic graphs, J. Combin. Theory Ser. B 56 (1992), pp. 16–44. doi: 10.1016/0095-8956(92)90004-H
- R. Nedela and M. Škoviera, Atoms of cyclic connectivity in cubic graphs, Math. Slovaca 45 (1995), pp. 481–499.
- B. Peroche, On several sorts of connectivity, Discrete Math. 46 (1983), pp. 267–277. doi: 10.1016/0012-365X(83)90121-8
- P.G. Tait, Remarks on the coloring of maps, Proc. Roy. Soc. Edinburg 10 (1880), pp. 501–503.