Some finiteness results concerning separation in graphs
Motivated by applications to groups, J. Stallings and M. J. Dunwoody proved that a fixed edge in a connected, locally finite graph can occur in only finitely many smallest edge-cuts. This and other similar results are treated and generalized in an elegant and concise way in the present paper.
scientific article; zbMATH DE number 89894