Bipartite graph

In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets ${\displaystyle U}$ and ${\displaystyle V}$ (that is, ${\displaystyle U}$ and ${\displaystyle V}$ are each independent sets) such that every edge connects a vertex in ${\displaystyle U}$ to one in ${\displaystyle V}$. Vertex sets ${\displaystyle U}$ and ${\displaystyle V}$ are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.

...
Wikipedia