Given specified bipartitions, a bipartite graph isomorphism, also called a bipartite isomorphism, is a graph isomorphism between bipartite graphs that maps each part of the first bipartition to the corresponding part of the second bipartition. Thus, in addition to preserving adjacency, a bipartite graph isomorphism preserves the two vertex types determined by the bipartition.
Bipartite Graph Isomorphism
See also
Bipartite Graph, Bipartition, Graph Isomorphism, Isomorphic GraphsExplore with Wolfram|Alpha
References
Tsoukalas, G. et al. "Advancing Mathematics Research with AI-Driven Formal Proof Search." 21 May 2026. https://arxiv.org/abs/2605.22763.Cite this as:
Weisstein, Eric W. "Bipartite Graph Isomorphism." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BipartiteGraphIsomorphism.html