 Two-colourability criterion for bipartite graphs

A finite graph is bipartite exactly when it has a proper colouring with two colours. Equivalently,for its chromatic polynomial.