Bipartite Graph

A graph whose vertices can be divided into 2 independent sets $U,V$ such that every edge $(u,v)$ either connects to a vertex from $U$ to $V$, or a vertex from $V$ to $U$.

• No edge connects $V\to V$
• No edge connects $U\to U$
• With $U$ as blue
• With $V$ as red