The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known as the maximum leaf number.) A traceable graph on 2 or more vertices therefore has minimum leaf number 2.

maximum leaf number | spanning tree | tree leaf