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.

[1]  Michael D. Plummer,et al.  On n-extendable graphs , 1980, Discret. Math..

[2]  Dingjun Lou,et al.  On the 2-extendability of planar graphs , 1991, Discret. Math..

[3]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[4]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[5]  Dingjun Lou,et al.  Lower bound of cyclic edge connectivity for n-extendability of regular graphs , 1993, Discret. Math..

[6]  Pak-Ken Wong,et al.  Cages - a survey , 1982, J. Graph Theory.