@article{Tsugaki2007SpanningTW,
title={Spanning Trees with Few Leaves},
author={Masao Tsugaki and Tomoki Yamashita},
journal={Graphs and Combinatorics},
year={2007},
volume={23},
pages={585-598}
}

In this paper, we prove that an m-connected graph G on n vertices has a spanning tree with at most k leaves (for k ≥ 2 and m ≥ 1) if every independent set of G with cardinality m+k contains at least one pair of vertices with degree sum at least n−k+1. This is a common generalization of results due to Broersma and Tuinstra and to Win.