✦ LIBER ✦

A mixed version of Menger's theorem

✍ Scribed by Yoshimi Egawa; Atsushi Kaneko; Makoto Matsumoto

Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 223 KB
Volume: 11
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01375475

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 proof of Menger's theorem

✍ J. S. Pym 📂 Article 📅 1969 🏛 Springer Vienna 🌐 English ⚖ 149 KB

A remark on Menger's theorem

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

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