Nash-Williams’ cycle-decomposition theorem

Abstract

We give an elementary proof of the theorem of Nash-Williams that a graph has an edge-decomposition into cycles if and only if it does not contain an odd cut. We also prove that every bridgeless graph has a collection of cycles covering each edge at least once and at most 7 times. The two results are equivalent in the sense that each can be derived from the other.

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

References

  1. [1]

    J. A. Bondy and U. S. R. Murty: Graph Theory with Applications, The MacMillan Press Ltd. (1976).

    Google Scholar 

  2. [2]

    R. Diestel: Graph Theory, Springer Verlag (1997) and 4th edition (2010).

    Google Scholar 

  3. [3]

    F. Jaeger: Flows and Generalized Coloring Theorems in Graphs, Journal of Combinatorial Theory, Series B 26 (1979), 205–216.

    MathSciNet  Article  MATH  Google Scholar 

  4. [4]

    F. Laviolette: Decompositions of infinite Graphs: I- bond-faithful decompositions, Journal of Combinatorial Theory, Series B 94 (2005), 259–277.

    MathSciNet  Article  MATH  Google Scholar 

  5. [5]

    F. Laviolette: Decompositions of infinite Graphs: II- circuit decompositions, Journal of Combinatorial Theory, Series B 94 (2005), 278–333.

    MathSciNet  Article  MATH  Google Scholar 

  6. [6]

    C. St. J. A. Nash-Williams: Decomposition of graphs into closed and endless chains, Proc. London Math. Soc. 3 (1960), 221–238.

    MathSciNet  Article  MATH  Google Scholar 

  7. [7]

    C. St. J. A. Nash-Williams: Infinite graphs- a survey, J. Combin. Theory 3 (1967), 286–301.

    MathSciNet  Article  MATH  Google Scholar 

  8. [8]

    L. Soukup: Elementary submoduls in infinite combinatorics, arXiv 10007.4309v2 [math.LO] 6.Dec.2010.

  9. [9]

    C. Thomassen: Infinite graphs, in: Further Selected Topics in Graph Theory (L. W. Beineke and R. J. Wilson, eds.), Academic Press, London (1983), 129–160.

    Google Scholar 

  10. [10]

    C. Thomassen: Orientations of infinite graphs with prescribed edge-connectivity, Combinatorica, to appear.

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Carsten Thomassen.

Additional information

Research partly supported by ERC Advanced Grant GRACOL.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Thomassen, C. Nash-Williams’ cycle-decomposition theorem. Combinatorica 37, 1027–1037 (2017). https://doi.org/10.1007/s00493-016-3424-8

Download citation

Mathematics Subject Classification (2000)

  • 05C38
  • 05C40
  • 05C63