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
## 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
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
## 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