A theorem on integer flows on cartesian products of graphs
✍ Scribed by Wilfried Imrich; Riste Škrekovski
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 72 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
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
📜 SIMILAR VOLUMES
In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John
Let be a finite subset of the Cartesian product W 1 × • • • × W n of n sets. For A ⊂ {1, 2, . . . , n}, denote by A the projection of onto the Cartesian product of W i , i ∈ A. Generalizing an inequality given in an article by Shen, we prove that , 2, . . . , n}. This inequality is applied to give s
Recent analyses of baseball managers' performances have employed the so-called `Pythagorean Theorem' of baseball. This `theorem' states that the ratio of wins to losses can be approximated by the square of the ratio of team runs scored to opposition runs scored. Recent publications assume this appro