N-extendability of symmetric graphs

It is proved that a cyclically (k ? 1)(2n ? 1)-edge-connected edge transitive k-regular graph with even order is n-extendable, where k ≥ 3 and k ? 1 ≥ n ≥ ?(k + 1)/2?. The bound of cyclic edge connectivity is sharp when k = 3. © 1993 John Wiley & Sons, Inc.