Join of two graphs admits a nowhere-zero 3-flow

Abstract

Let G be a graph, and λ the smallest integer for which G has a nowherezero λ-flow, i.e., an integer λ for which G admits a nowhere-zero λ-flow, but it does not admit a (λ − 1)-flow. We denote the minimum flow number of G by Λ(G). In this paper we show that if G and H are two arbitrary graphs and G has no isolated vertex, then Λ(GH) ⩽ 3 except two cases: (i) One of the graphs G and H is K 2 and the other is 1-regular. (ii) H = K 1 and G is a graph with at least one isolated vertex or a component whose every block is an odd cycle. Among other results, we prove that for every two graphs G and H with at least 4 vertices, Λ(GH) ⩽ 3.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    F. Jaeger: Flows and generalized coloring theorems in graphs. J. Comb. Theory, Ser. B 26 (1979), 205–216.

    Article  MATH  MathSciNet  Google Scholar 

  2. [2]

    F. Jaeger: Nowhere-zero flow problems. Selected Topics in Graph Theory 3. Academic Press, San Diego, 1988, pp. 71–95.

    Google Scholar 

  3. [3]

    R. Luo, W. Zang, C. Zhang: Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares. Combinatorica 24 (2004), 641–657.

    Article  MATH  MathSciNet  Google Scholar 

  4. [4]

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

    Article  MATH  MathSciNet  Google Scholar 

  5. [5]

    H. Shahmohamad: On minimum flow number of graphs. Bull. Inst. Comb. Appl. 35 (2002), 26–36.

    MATH  MathSciNet  Google Scholar 

  6. [6]

    C. Thomassen, B. Toft: Non-separating induced cycles in graphs. J. Comb. Theory, Ser. B 31 (1981), 199–224.

    Article  MATH  MathSciNet  Google Scholar 

  7. [7]

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

    Article  MATH  MathSciNet  Google Scholar 

  8. [8]

    W. T. Tutte: On the imbedding of linear graphs in surfaces. Proc. Lond. Math. Soc., II. Ser. 51 (1949), 474–483.

    MATH  MathSciNet  Google Scholar 

  9. [9]

    D. B. West: Introduction to Graph Theory. Prentice Hall, Upper Saddle River, 1996.

    MATH  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Saieed Akbari.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Akbari, S., Aliakbarpour, M., Ghanbari, N. et al. Join of two graphs admits a nowhere-zero 3-flow. Czech Math J 64, 433–446 (2014). https://doi.org/10.1007/s10587-014-0110-0

Download citation

Keywords

  • nowhere-zero λ-flow
  • minimum nowhere-zero flow number
  • join of two graphs

MSC 2010

  • 05C20
  • 05C21
  • 05C78