The maximum leaf number of a graph is the largest number of tree leaves
in any of its spanning trees. (The corresponding
smallest number of leaves is known as the minimum
leaf number.)

Fellows, M.; Lokshtanov, D.; Misra, N.; Mnich, M.; Rosamond, F.; and Saurabh, S. "The Complexity Ecology of Parameters: an Illustration Using
Bounded Max Leaf Number." Th. Comput. Sys.45, 822-848, 2009.Lu,
H.-I. and Ravi, R. "Approximating Maximum Leaf Spanning Trees in Almost Linear
Time." J. Algorithms29, 132-141, 1998.Solis-Oba,
R. "2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number
of Leaves." In Proceedings of Algorithms--ESA '98. 6th Annual European Symposium
Venice, Italy, August 24-26, 1998 (Ed. G. Bilardi, G. F. Italiano,
A. Pietracaprina, and G. Pucci). Belin: Springer, pp. 441-452, 1998.Zhou,
G.; Gen, M.; and Wu, T. "A New Approach to the Degree-Constrained Minimum Spanning
Tree Problem Using Genetic Algorithm." In IEEE International Conference on
Systems, Man, and Cybernetics, 1996, Vol. 4, pp. 2683-2688, 1996.