The problem of finding a hamiltonian cycle in a bipartite graph w

The problem of finding a hamiltonian cycle in a bipartite graph with an odd number of vertices is NP complete. ~@[](1)

答案：FALSE