Edge-connectivity and tree-structure in finite and infinite graphs

Abstract

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.