bipartite graph
Sign in to saveAlso known as bigraph, bipartite network, odd-cycle-free graph, bicolorable graph, bi-partite
graph whose vertices can be divided into two disjoint and independent sets
Wikidata facts
- Subclass of
- line perfect graph
- Image
- HinhVeCM.png
- Has parts of class
- disjoint sets
Show 5 more facts
- topic's main category
- Category:Bipartite graphs
- Commons category
- Bipartite graphs
- studied by
- graph theory
- has characteristic
- chromatic number
- maintained by WikiProject
- WikiProject Mathematics
Sources (3)
via Wikidata · CC0
~19 min read
Encyclopedic overview
A complete bipartite graph with m = 5 and n = 3 The Heawood graph is bipartite. In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets
U
Excerpted from Wikipedia’s “bipartite graph” article, available under the CC BY-SA 4.0 licence.