Bipartition
A bipartition of a graph is a partition of its vertex set into two parts such that every graph edge has its endpoints in different parts. A graph admitting a bipartition is a bipartite graph.
See also
Bipartite Graph, Graph Two-Coloring, Partition, Vertex SetExplore with Wolfram|Alpha
WolframAlpha
More things to try:
References
Skiena, S. "Coloring Bipartite Graphs." §5.5.2 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 213, 1990.Cite this as:
Weisstein, Eric W. "Bipartition." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Bipartition.html