Some finiteness results concerning separation in graphs
type: Item
instance of: scholarly article
title: Some finiteness results concerning separation in graphs
zbMATH Open document ID: 0772.05063
DOI: 10.1016/0012-365X(92)90594-6
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
review text: 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.
reviewed by: Carsten Thomassen
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 89894
zbMATH Keywords: separation in graphs
zbMATH Keywords: connected
zbMATH Keywords: locally finite graph
zbMATH Keywords: edge-cuts
author: Rudolf Halin
MaRDI profile type: Publication
cites work: Q3999150
cites work: Cutting up graphs
cites work: Q3992521
cites work: Q3972519
cites work: Q3356323
cites work: Finite separating sets in locally finite graphs
cites work: Q5651924
description: scientific article; zbMATH DE number 89894