Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 3 / 17G / a

A graph $G=(V,E)$ is bipartite when its set of vertices can be partitioned asso 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.