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
- Image
- HinhVeCM.png
Show 1 more fact
- Commons category
- Bipartite graphs
Sources (3)
via Wikidata · CC0
~19 min read
Article
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
Connections
node
Entity
graph coloring
Entity
time complexity
Entity
independent set
Entity
glossary of graph theory terms
Entity
parameterized complexity
Entity
mathematics
Entity
International Standard Book Number
Entity
algorithm
Entity
Wayback Machine
Entity
digital object identifier
Entity
plane
Entity
graph theory
Entity
line segment
Entity
graph
Entity
Q118398
Entity
four color theorem
Entity
cardinality
Entity
if and only if
Entity
axiom of choice
Entity