Q. ____________ is finding a path/tour through the graph such that every vertex is visited exactly once. (Solved)

1. Travelling Salesman tour.

2. Eulerian tour.

3. Hamiltonian tour.