TY - MGZN
AU - Marcote, F.
AU - Pelayo, I. M.
AU - Balbuena, C.
AU - Fàbrega, J.
T2 - Discrete mathematics
Y1 - 2005
VL - 301
IS - 1
SP - 124
EP - 136
DO - 10.1016/j.disc.2004.11.026
UR - http://dx.doi.org/10.1016/j.disc.2004.11.026
AB - A regular graph G of degree d and girth g is said to be a (d,g)-cage if it has the least number of vertices among all d-regular graphs with girth g. A graph is called k-connected if the order of every cutset is at least k . In this work, we prove that every (d,g)-cage is 4-connected provided that either d=4, or d¿5 and g¿10. These results support the conjecture of Fu, Huang and Rodger that all (d,g)-cages are d-connected.
TI - (d,g)-cages with g >= 10 are 4-connected
ER -