A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of vertices. We prove that all ([delta],g)-cages are r-connected with for g[greater-or-equal, slanted]7 odd. This result supports the conjecture of Fu, Huang and Rodger that all ([delta];g)-cages are [delta]-connected.
Discrete Mathematics Vol. 299, no. 1-3, p. 162-171