|
|
In the mathematical field of graph theory, a bipartite graph is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V; that is, U and V are independent sets. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycle.
created by syam1224 on 2008-04-23 21:58:31
|
|
|
|
Bipartite graph from Wikipedia
Thus, one may efficiently test whether a graph is bipartite by using this parity technique to assign vertices to the two subsets U and V, separately within each connected component of the graph, and then examine each edge to verify that it has endpoints assigned to different subsets.
http://en.wikipedia.org/wiki/Bipartite_graph
created by syam1224 on 2008-04-23 22:00:37
|
|
Bipartite Graph from Mathworld
A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A bipartite graph is a special case of a k-partite graph with k=2.
http://mathworld.wolfram.com/BipartiteGraph.html
created by syam1224 on 2008-04-23 22:01:54
|
|
|
