All (k;g)‐cages are k‐edge‐connected

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 g is odd. Combining our results, we conclude that the (k;g)‐cages are k‐edge‐connected. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 219–227, 2005