Which of the following graphs is guaranteed to have a Hamiltonian path?
Any tree with at least 3 vertices.
Every complete graph KnK_nKn for n≥2n \geq 2n≥2.
Every bipartite graph.
Any graph with more edges than vertices.