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

A **bipartite graph** is a graph whose vertices can be divided into two disjoint and independent sets

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 *complete bipartite graph*.

If

A graph