Assume that the graph G is connected and has the property that for every two vertices u, v E V(G), the length of each u - v path is even or odd. Prove that G is bipartite