Bipartite graph

Bipartite graph

A graph (directed graph or undirected graph) is bipartite if you can partition the vertex set such that for all we have and or vice versa.