1. O. R. Oellermann, Connectivity and edge-connectivity in graphs: A survey, Congressus Numerantium, 116 (1996), 231–252.
2. B. Peroche, On several sorts of connectivity, Discrete Math., 46 (1983), 267–277.
3. Z. Dvořák, J. Kára, D. Král, O. Pangrác, An algorithm for cyclic edge connectivity of cubic graphs, In: Algorithm Theory-SWAT 2004, Springer, Berlin, Heidelberg, 2004,236–247.
4. D. Lou, W. Wang, An efficient algorithm for cyclic edge connectivity of regular graphs, Ars Combinatoria, 77 (2005), 311–318.
5. D. Lou, K. Liang, An improved algorithm for cyclic edge connectivity of regular graphs, Ars Combinatoria, 115 (2014), 315–333.