Question: Prove that a graph G is bipartite if and only if every cycle in some cycle basis of G is even ?? If G is a connected non-bipartite graph with n vertices, prove that there is a connected subgraph H of G with n vertices and n edges and with a unique cycle of odd length.