What is a necessary condition for a tree to have a Hamiltonian path?
I assume the solution to this question is that a tree can only have two leaves because if there are 3 vertices who have degree 1, then for a path to traverse all vertices, it cannot visit each vertex exactly once. thus cannot be Hamiltonian.
Is that correct?