Mathematics — Graph Theory · tree-hamiltonian-cycle
Problem
Let T be a tree having more than 1 vertex. Let L be the set of leaves of T. Prove that it is possible to add ∣L∣−1 new edges to T in such a way that the resulting multigraph has a Hamiltonian cycle.