Combinatorics Graph theory: basic notions Concept
Bipartite graph
Summary
A bipartite graph is a graph whose vertices split into two parts with every edge between the parts. Bipartite graphs model relations between two kinds of object, and they are the setting of matching theory. The node bipartite graph gives the precise definition.
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Bipartite_graph, lead section
About this page
| Tag | 0ZVQKTRKVQ |
|---|---|
| URI | m2://0ZVQKTRKVQ |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C75 |
| Specializes | K-colourable graph |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.