Cages and cyclic connectivity

Robert Lukoťka, Edita Máčajová, Jozef Rajník

A graph $G$ is cyclically $c$-edge-connected if there is no set of fewer than $c$ edges that disconnects $G$ into at least two cyclic components. We prove that if a $(k,g)$-cage $…