(definition)
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 ...)
layered graph.
Note: A bipartite graph is a layered graph with two layers.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Mon Apr 11 09:14:16 2005.
HTML page formatted Mon Dec 19 14:07:46 2005.
Cite this as:
Paul E. Black, "bipartite graph", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bipartgraph.html
