Difference between revisions of "Bipartite graphs"
From Cohen Courses
Jump to navigationJump to search (Created page with '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. File:Bipartite-graph.jpg') |
m (1 revision: trying again...) |
(No difference)
| |
Latest revision as of 15:21, 7 September 2010
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.
