Bipartite graph

Uncommon card · No. 157536

In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U {\displaystyle U} and V {\displaystyle V} , that is, every edge connects a vertex in U {\displaystyle U} to one in V {\displaystyle V} . Vertex sets U {\displaystyle U} and V {\displaystyle V} are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles. The two sets U {\displaystyle U} and V {\displaystyle V} may be thought of as a coloring of the graph with two colors: if one colors all nodes in U...

Read on Wikipedia · Image Watchduck You can name the author as "T. Piesk", "Tilman Piesk" or "Watchduck"., CC BY-SA 4.0