A graph is said to be 'bipartite' if and only if:
It contains at least one odd cycle.
It contains no odd cycles.
It is a complete graph.
It is a tree.