Minimum Degree, Leaf Number, and Hamiltonicity

Let G be a finite connected graph with minimum degree δ > 4. The leaf number L(G) of G is defined as the maximum number of leaf vertices contained in a spanning tree of G. We show that if δ ≥ L(G) ...