Minimal Separators in Graphs
From MaRDI portal
Abstract: The Known Menger's theorem states that in a finite graph, the size of a minimum separator set of any pair of vertices is equal to the maximum number of disjoint paths that can be found between these two vertices. In this paper, we study the minimal separators of two non-adjacent vertices in a finite graph, and we give a new elementary proof of Menger's theorem.
This page was built for publication: Minimal Separators in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6317146)
