Two-colourability criterion for bipartite graphs
= Two-colourability criterion for bipartite graphs
A finite graph is <bipartite graph>[bipartite] exactly when it has a proper colouring with two colours. Equivalently,
$$
P_G(2)>0
$$
for its <chromatic polynomial>.