Branches History Index

◀ ▲ ▶Branches / Graph-theory / Lemma: Splitting a Graph with Even Degree Vertices into Cycles

Lemma: Splitting a Graph with Even Degree Vertices into Cycles

Let \(G(V,E)\) be a simple graph in which each vertex has even degree. Then \(G\) can be split into cycles, no two of which have an edge in common.

Table of Contents

Proofs: 1

Mentioned in:

Proofs: 1

Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs

References

Bibliography

  1. Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000