Abstract
The flow polynomials denote the number of nowhere-zero flows on graphs, and are related to the well-known Tutte polynomials and chromatic polynomials. We will show the decomposition of the flow polynomials by edge-cuts and vertex-cuts of size 2 or 3. Moreover by using this decomposition, we will consider what kind of graphs have the same flow polynomials. Another application of the decomposition results is that if a bridgeless graph G does not admit a nowhere-zero k-flow and G has a small vertex- or edge-cut, then a proper bridgeless subgraph of G (a graph minor) does not admit a nowhere-zero k-flow either.
Similar content being viewed by others
References
Fan, G.: Integer flows and cycle covers. J. Comb. Theory Ser. B 54, 113–122 (1992)
Jaeger, F.: Nowhere-zero flow problems. In: L.W. Beineke et al.: Selected topics in graph theory 3 (chapter 4, pp. 71–95) Academic-Press 1988
Oxley, J.G.: Matroid theory, Oxford Science Publications 1992.
Read, R.C.: An introduction to chromatic polynomials. J. Comb. Theory 4, 52–71 (1968)
Seymour, P.D.: Nowhere-zero 6-flows. J. Comb. Theory Ser. B 30, 130–135 (1981)
Seymour, P.D.: Nowhere-zero flow. In: R. Graham et al.: Handbook of combinatorics, Elsevier Science Publishers 1993
Tutte, W.T.: A contribution to the theory of chromatic polynomials. Canad. J. Math. 6, 80–91 (1954)
Welsh, D.J.A.: Matroid theory (London Math. Soc., vol. 8), Academic Press London 1976
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sekine, K., Zhang, C.Q. Decomposition of the Flow Polynomial. Graphs and Combinatorics 13, 189–196 (1997). https://doi.org/10.1007/BF03352995
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03352995