A proof of Menger's theorem

A new proof of menger's theorem

✍ Peter V. O'Neil 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 1 views

## Abstract A new proof of Menger's theorem is presented.

A simple proof of Menger's theorem

✍ William McCuaig 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 1 views

## Abstract A proof of Menger's theorem is presented.

More proofs of menger's theorem

✍ C. St. J. A. Nash-Williams; W. T. Tutte 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

## Abstract Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite undirected graph __G__ if it holds for the graphs obtained from __G__ by deleting and contracting the same edge. The other two prove the directed version of

Menger's Theorem

✍ T. Böhme; F. Göring; J. Harant 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB

## Abstract Menger's Theorem for digraphs states that for any two vertex sets __A__ and __B__ of a digraph __D__ such that __A__ cannot be separated from __B__ by a set of at most __t__ vertices, there are __t + 1__ disjoint __A__–__B__‐paths in __D__. Here a short and elementary proof of a more ge

A generalization of Menger’s Theorem

✍ Sunil Mathew; M.S. Sunitha 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 226 KB

This paper generalizes one of the celebrated results in Graph Theory due to Karl. A. Menger (1927), which plays a crucial role in many areas of flow and network theory. This paper also introduces and characterizes strength reducing sets of nodes and arcs in weighted graphs.

A remark on Menger's theorem

✍ L. Lovász 📂 Article 📅 1970 🏛 Akadmiai Kiad 🌐 English ⚖ 198 KB