nLab
bipartite graph

A bipartite graph is a graph GG whose vertices can be 2-colored, i.e., such that there exists a graph homomorphism GK 2G \to K_2. Note that a bipartite graph cannot have any loops, although it may have multiple edges.

References