Spanning tree packing and 2-essential edge-connectivity

Xiaofeng Gu, Runrun Liu, Gexin Yu

An edge (vertex) cut $X$ of $G$ is $r$-essential if $G-X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$-essentially $k$-edge-connected (resp. $k$-conn…