Citation
T. Bohme et al., Menger's Theorem, J GRAPH TH, 37(1), 2001, pp. 35-36
Citations number
3
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024
→ ACNP
Volume
37
Issue
1
Year of publication
2001
Pages
35 - 36
Database
ISI
SICI code
0364-9024(200105)37:1<35:MT>2.0.ZU;2-1
Abstract
Menger's Theorem for digraphs states that for any two vertex sets A and B o
f 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 element
ary proof of a more general theorem is given. (C) 2001 John Wiley & Sons, I
nc.