Bipartite Graph Theorem

The animation explains the Bipartite Graph Theorem. It shows what a bipartite graph is (a graph where you can divide the nodes into two groups so that all edges connect nodes from different groups), how to color the nodes with two colors such that no adjacent nodes have the same color, and then demonstrates a counterexample to show that not all graphs are bipartite.