Spanning trees with at most leaves in -free graphs

We obtain a sufficient condition for K 1 , 4 -free graphs to have spanning trees with at most k leaves, as a generalization of the condition of Kyaw [A. Kyaw, Spanning trees with at most 3 leaves in K 1 , 4 -free graphs, Discrete Math. 309 (2009) 6146–6148] for K 1 , 4 -free graphs to have spanning trees with at most 3 leaves.