Definition: An undirected graph where vertices can be partitioned into two sets such that no edge connects vertices in the same set.
Generalization (I am a kind of ...)
Note: A bipartite graph is a layered graph with two layers.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 11 April 2005.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "bipartite graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 11 April 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/bipartgraph.html