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.

翻译：我们显示每个图表都同时接收了 与金刚树相似的分解成 $k$-geet-连结的碎片 $k\in\ mathbb{N ⁇ cup}infty}$。