Bipartite Graph

Question

Which of the following complete bipartite graphs will have Hamiltonian cycle?

$a)K_{3,3}$

$b)K_{2,4}$

Comments

that statement is wrong.

---

Thank you sir :)

---

A hamiltonian Path in an undirected graph is a path that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian Path such that there is an edge (in the graph) from the last vertex to the first vertex of the Hamiltonian Path.