Bipartite graph

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

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

Prerequisite nodes