Branches History Index

◀ ▲ ▶Branches / Graph-theory / Theorem: Characterization of Bipartite Graphs

Theorem: Characterization of Bipartite Graphs

A undirected graph \(G(V,E,\gamma)\) is bipartite, if and only if is connected and has no cycles \(C^k\) of an odd length \(k\).

Table of Contents

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