1 paper
Tingzeng Wu, Shuang Ma, Hong-Jian Lai
Let G be a connected bridgeless (n,m)-graph which may have loops and multiedges, and let F(G,t) denote the flow polynomial of G. Dong and Koh \cite{Dong1} established an up…