Uniform cyclic edge connectivity in cubic graphs

A cubic graph which is cyclicallyk-edge connected and has the further property that every edge belongs to some cyclick-edge cut is called uniformly cyclicallyk-edge connected(U(k)). We classify theU(5) graphs and show that all cyclically 5-edge connected cubic graphs can be generated from a small finite set ofU(5) graphs by a sequence of defined operations.