Counting Flows of $b$-compatible Graphs

Houshan Fu, Xiangyu Ren, Suijie Wang

Kochol introduced the assigning polynomial $F(G,\alpha ;k)$ to count nowhere-zero $(A,b)$-flows of a graph $G$, where $A$ is a finite Abelian group and $\alpha$ is a $\{0,1\}$-assigning from…