𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Theorem on Flow in Directed Graphs

✍ Scribed by Artzner, Ph.; Rado, R.


Book ID
120096689
Publisher
Oxford University Press
Year
1979
Tongue
English
Weight
105 KB
Volume
s2-19
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Minimax Theorem for Directed Graphs
✍ Lucchesi, C. L.; Younger, D. H. πŸ“‚ Article πŸ“… 1978 πŸ› Oxford University Press 🌐 English βš– 170 KB
Theorem on directed graphs, applicable t
✍ D. J. Shoesmith; T. J. Smiley πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 224 KB

## Abstract A semicycle is said to turn at a point __a__ if the arcs incident to __a__ are both to it or both from it. We prove that if a nonempty set of points of a finite directed graph contains a turning point of each semicycle, then one of its members is a turning point of every semicycle to wh

On a game in directed graphs
✍ Alan J. Hoffman; Kate Jenkins; Tim Roughgarden πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 61 KB

Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any) and eliminates the other endpoint of this arc; the remaining vertices play on until no arcs remain. We call a directed g

A theorem on integer flows on cartesian
✍ Wilfried Imrich; Riste Ε krekovski πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 72 KB

## Abstract It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003

A Theorem on Sum Graphs
✍ G. Santhosh; G. Suresh Singh πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 66 KB