Bipartíció
Bipartíció is a term used in graph theory to describe a specific property of graphs. A graph is considered bipartite if its vertices can be divided into two disjoint and independent sets, U and V, such that every edge connects a vertex in U to one in V. In simpler terms, there are no edges connecting two vertices within the same set. This means that if you pick any vertex, all of its neighbors must belong to the other set.
One of the key characteristics of bipartite graphs is that they do not contain any odd-length cycles.
There are efficient algorithms to determine if a graph is bipartite, often involving a breadth-first search