On the number of -flows of a graph

We exhibit explicit constructions of contractors for the graph parameter counting the number of B -flows of a graph, where B is a subset of a finite Abelian group closed under inverses. These constructions are of great interest because of their relevance to the family of B -flow conjectures formulated by Tutte, Fulkerson, Jaeger, and others.