This problem recently gained a lot of interest in the context of
cutting planes for the Subtour Elimination Polytope, a common
relaxation of the Traveling Salesman Polytope.
In this talk I will explain the cactus representation [Dinitz 76] of
all minimum cuts of a graph.