Circular flow numbers of regular multigraphs

The circular flow number Fc(G) of a graph G = (V, E) is the minimum r ϵ ℚ such that G admits a flow ϕ with 1 ≤ ϕ (e) ≤ r − 1, for each e ϵ E. We determine the circular flow number of some regular multigraphs. In particular, we characterize the bipartite (2t+1)-regular graphs (t ≥ 1). Our results imply that there are gaps for possible circular flow numbers for (2t+1)-regular graphs, e.g., there is no cubic graph G with 3 < Fc(G) < 4. We further show that there are snarks with circular flow number arbitrarily close to 4, answering a question of X. Zhu. © 2000 John Wiley & Sons, Inc. J Graph Theory 36: 24–34, 2001