◀ ▲ ▶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
- Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000