Decomposition formulas for the flow polynomial

The flow polynomial FG(k) of a graph G evaluates the number of nowhere-zero A-flows in G for any Abelian group A of order k. Suppose that C is an edge cut of G and G1, G2 are the components of G−C. We give a formula expressing the flow polynomial of G from the flow polynomials of the bridgeless minors of G having edge sets equal either to C, or to E(G1)∪C, or to E(G2)∪C.