A (k;g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In this paper, we prove that (k;g)-cages are k-edge-connected if g is even. Earlier, Wang, Xu, and Wang proved that (k;g)-cages are k-edge-connected if 9 is odd. Combining our results, we conclude that the (k;g)-cages are k-edge-connected. (C) 2005 Wiley Periodicals, Inc.
Journal of Graph Theory Vol. 48, no. 3, p. 219-227