bipartite graph
graph whose vertices can be divided into two disjoint and independent sets
Facts
7 properties- Instance of
- graph class closed under taking subgraphs
- Subclass of
- bisplit graph, multipartite graph, triangle-free graph, parity graph, line perfect graph[2][3][4][5][6]
- Does not have part
- odd cycle[12]
- Has characteristic
- chromatic number[8]
- Has part(s) of the class
- edge, disjoint sets[10][11]
- Opposite of
- co-bipartite graph[7]
- Studied by
- graph theory[9]
🏷️ Also known as
en bigraph
en bicolorable graph
en odd-cycle-free graph
en bipartite network
en bipartite graph
en bi-partite
ar بيان شطراني
ar بيان ذو فرعين
cs sudý graf
cs bipartitní graf
da todelt graf
de paarer Graph
de bipartiter Graph
es grafo bipartito
fa گراف دوبخشی
fr graphe biparti
he גרף דו-צדדי
he גרף דו־צדדי
hu páros gráf
hu kétrészes gráf
🔖 Identifiers · 19
- GND ID
- 4145661-0
- OpenAlex ID
- C197657726
- Image (Wikimedia Commons)
- HinhVeCM.png ↗
- Australian Educational Vocabulary ID
- scot/15486
- BabelNet ID
- 01786867n
- Dictionary of Algorithms and Data Structures ID
- bipartgraph
- Encyclopedia of Mathematics article ID
- Graph,_bipartite
- Freebase ID
- /m/01kdsb
- Great Russian Encyclopedia portal ID
- dvudol-nyi-graf-9499cc
- Lexikon der Mathematik entry ID
- 2289
- MathWorld ID
- BipartiteGraph, BicolorableGraph
Show all 19 identifiers +7
- Microsoft Academic ID (discontinued)
- 197657726
- NLab ID
- bipartite graph
- PlanetMath ID
- BipartiteGraph
- ProofWiki ID
- Definition:Bipartite_Graph
- ScienceDirect topic ID
- computer-science/bipartite-graph, engineering/bipartite-graph, mathematics/bipartite-graph
- Topic's main category
- Category:Bipartite graphs
- Wolfram Language entity code
- Entity["GraphClass", "Bipartite"]
🔗 Connections
Examples 16
Subtypes 8
Subclass of 3
Has part(s) of the class 2
Has characteristic 1
Maintained by WikiProject 1
Studied by 1
Topic's main category 1
← Category's main topic 1
← Statement describes 1
Press Enter · cited answer in seconds
0 sources
Summary
bipartite graph is a graph class closed under taking subgraphs[1].