Combining our reduction with the polylogarithmic fully-dynamic connectivity and 2-edge-connectivity
algorithm of Holm, de Lichtenberg, and Thorup [1]}, we can now solve
decremental connectivity and 2-edge-connectivity in \(O(m)+\widetilde{O}(n)\)  time.
