Mehlhorn, KurtKurtMehlhornNeumann, AdrianAdrianNeumannSchmidt, Jens M.Jens M.Schmidt2020-10-232020-10-23201339th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013)http://hdl.handle.net/11420/7655We present a linear-time certifying algorithm that tests graphs for 3-edge-connectivity. If the input graph G is not 3-edge-connected, the algorithm returns a 2-edge-cut. If G is 3-edge-connected, the algorithm returns a construction sequence that constructs G from the graph with two nodes and three parallel edges using only operations that (obviously) preserve 3-edge-connectivity.enInformatikConference Paper10.1007/978-3-642-45043-3_31Other