1. Spanning trees in graphs of minimum degree 4 or 5
2. and Spanning trees with many leaves, lecture at SIAM Discrete Math, Conf., San Francisco, 1988.
3. The maximum leaf spanning tree problem for cubic graphs is NP-complete, Institute for Mathematics and its Application, preprint, 1998.
4. Constructing full spanning trees for cubic graphs