Some finiteness results concerning separation in graphs (Q1197018)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some finiteness results concerning separation in graphs |
scientific article; zbMATH DE number 89894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some finiteness results concerning separation in graphs |
scientific article; zbMATH DE number 89894 |
Statements
Some finiteness results concerning separation in graphs (English)
0 references
16 January 1993
0 references
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.
0 references
separation in graphs
0 references
connected
0 references
locally finite graph
0 references
edge-cuts
0 references
