 Bipartite graph

A graph is bipartite when its vertices split into two classes and every edge joins the two different classes.

A bipartite graph is a specific type of graph in graph theory that can be divided into two distinct sets of vertices such that no two vertices within the same set are adjacent. In other words, the edges of a bipartite graph only connect vertices from one set to vertices from the other set.