Decomposition of cubic graphs with cyclic connectivity 5

Edita Máčajová, Jozef Rajník

Let $G$ be a cyclically $5$-connected cubic graph with a $5$-edge-cut separating $G$ into two cyclic components $G_1$ and $G_2$. We prove that each component $G_i$ can be completed…