Comment by aleph_minus_one

> Forests, trees, and bipartite graphs are 2-colorable.

More precise: a graph is bipartite if and only if it is 2-colorable (this can actually be used as a definition).

Since forests are bipartite, and trees are forests, the other two statements follow.