Bipartite graphs

From Cohen Courses
Revision as of 16:21, 7 September 2010 by WikiAdmin (talk | contribs) (1 revision: trying again...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

A bipartite graph is a graph where nodes can be divided into two groups V1 and V2 such that no edge connects the vertices in the same group.

Bipartite-graph.jpg

Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php?title=Bipartite_graphs&oldid=1477"