Low-degree spanning trees of $2$-edge-connected graphs in linear time

We present a simple linear-time algorithm that finds a spanning tree $T$ of a given $2$-edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{{\mathrm{°}}_G(v)}{2}\rceil +1$.