𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Minimax Theorem for Directed Graphs

✍ Scribed by Lucchesi, C. L.; Younger, D. H.

Book ID
120096577
Publisher
Oxford University Press
Year
1978
Tongue
English
Weight
170 KB
Volume
s2-17
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A minimax theorem for infinite graphs wi
A minimax theorem for infinite graphs with ideal points
✍ Norbert Polat πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 617 KB

Polat, N., A minimax theorem for infinite graphs with ideal points, Discrete Mathematics 103 (1992) 57-65. Let d be a family of sets of ends of an infinite graph, having the property that every element of any member of 1 can be separated from the union of all other members by a finite set of vertice

On two minimax theorems in graph
On two minimax theorems in graph
✍ LΓ‘szlΓ³ LovΓ‘sz πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 400 KB
A Theorem on Flow in Directed Graphs
A Theorem on Flow in Directed Graphs
✍ Artzner, Ph.; Rado, R. πŸ“‚ Article πŸ“… 1979 πŸ› Oxford University Press 🌐 English βš– 105 KB
The Separator Theorem for Rooted Directe
The Separator Theorem for Rooted Directed Vertex Graphs
✍ B.S. Panda πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 109 KB

In this note we point out a flaw in the separator theorem for rooted directed vertex graphs due to C. L. Monma and V. K. Wei (1986, J. Combin. Theory Ser. B 41, 141 181), and present a modified separator theorem for the same class of graphs.