Skip to main content
Log in

Decomposition of the Flow Polynomial

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Fan, G.: Integer flows and cycle covers. J. Comb. Theory Ser. B 54, 113–122 (1992)

    Article  Google Scholar 

  2. 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

  3. Oxley, J.G.: Matroid theory, Oxford Science Publications 1992.

  4. Read, R.C.: An introduction to chromatic polynomials. J. Comb. Theory 4, 52–71 (1968)

    Article  MathSciNet  Google Scholar 

  5. Seymour, P.D.: Nowhere-zero 6-flows. J. Comb. Theory Ser. B 30, 130–135 (1981)

    Article  MathSciNet  Google Scholar 

  6. Seymour, P.D.: Nowhere-zero flow. In: R. Graham et al.: Handbook of combinatorics, Elsevier Science Publishers 1993

  7. Tutte, W.T.: A contribution to the theory of chromatic polynomials. Canad. J. Math. 6, 80–91 (1954)

    Article  MATH  MathSciNet  Google Scholar 

  8. Welsh, D.J.A.: Matroid theory (London Math. Soc., vol. 8), Academic Press London 1976

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03352995

Keywords

Navigation