(definition)

**Definition:**
An *undirected graph* where *vertices* can be *partition*ed 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

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 11 April 2005.

HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:

Paul E. Black, "bipartite graph", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 11 April 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/bipartgraph.html