Prove that, if G is a bipartite graph with an odd number of vertices, then G is non-Hamiltonian Yes, your proof is quite correct.