Prove that a graph is bipartite if and only if it contains no odd cycles.
True only for planar graphs
True: use BFS/DFS coloring and parity arguments
False: only trees are bipartite
False: bipartite graphs can have odd cycles