  In this work, we present the first linear time deterministic algorithm
computing the 4-edge-connected components of an undirected graph. First, we
show an algorithm listing all 3-edge-cuts in a given 3-edge-connected graph,
and then we use the output of this algorithm in order to determine the
4-edge-connected components of the graph.
