Bipartite graph

A graph (directed graph or undirected graph) $G = (V,E)$ is bipartite if you can partition the vertex set $V = V_1 \cup V_2$ such that for all $(u,v) \in E$ we have $u \in V_1$ and $v \in V_2$ or vice versa.