Solution
= Solution
A <graph> $G=(V,E)$ is <bipartite> when its set of <vertices> can be partitioned as
$$
V=A\sqcup B
$$
so that every <edge> has one endpoint in $A$ and the other in $B$. Equivalently, $G$ has a proper <graph colouring> with at most two colours.