Topological graph theory
Nowhere-zero flows in random graphs
Journal of Combinatorial Theory Series B
An equivalent version of the 3-flow conjecture
Journal of Combinatorial Theory Series B
Graph Theory With Applications
Graph Theory With Applications
Circular flows of nearly Eulerian graphs and vertex-splitting
Journal of Graph Theory
Nowhere-zero 3-flows in locally connected graphs
Journal of Graph Theory
A theorem on integer flows on cartesian products of graphs
Journal of Graph Theory
Nowhere-zero 3-flows in products of graphs
Journal of Graph Theory
Nowhere-zero 3-flows in dihedral Cayley graphs
Information Processing Letters
Hi-index | 0.00 |
Tutte's 3-Flow Conjecture suggests that every bridgeless graph with no 3-edge-cut can have its edges directed and labelled by the numbers 1 or 2 in such a way that at each vertex the sum of incoming values equals the sum of outgoing values. In this paper we show that Tutte's 3-Flow Conjecture is true for Cayley graphs of groups whose Sylow 2-subgroup is a direct factor of the group; in particular, it is true for Cayley graphs of nilpotent groups. This improves a recent result of Poto驴nik et al. (Discrete Math. 297:119---127, 2005) concerning nowhere-zero 3-flows in abelian Cayley graphs.