двуделен граф, bigraph

A bipartite graph is a graph whose vertices can be divided into two disjoint and independent sets and , that is every edge connectes a vertex in to one in .

A bipartite graph is a graph that doesn’t contain any odd-length cycles.

If the set of edges of bipartite graph contains all vertices from and all vertices from it is called complete bipartite graph.

If and then the complete bipartite graph is denoted by .

contains vertices and edges.

A graph is bipartite iff all of its cycles are of even length.