# Bipartite graph

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Bipartite graph](https://ocme.evemisslab.com/en/atlas/atlas-bipartite-graph/)

A finite undirected simple graph is bipartite when all vertices split into two disjoint parts and every edge crosses between the parts.

atlas-bipartite-graph · canonical_mko

[Bipartite graph](https://ocme.evemisslab.com/en/mko/mko-bipartite-graph/)

## Prerequisite nodes


- [Finite simple undirected graphs](https://ocme.evemisslab.com/en/atlas/atlas-graph/)
- [Subset](https://ocme.evemisslab.com/en/atlas/atlas-subset/)
- [Function mapping](https://ocme.evemisslab.com/en/atlas/atlas-function-mapping/)