Aung Kyaw. Spanning trees with at most k leaves in K::1, 4::-free graphs. Discrete Mathematics, 311(20):2135-2142, 2011. [doi]
@article{Kyaw11,
title = {Spanning trees with at most k leaves in K::1, 4::-free graphs},
author = {Aung Kyaw},
year = {2011},
doi = {10.1016/j.disc.2011.06.025},
url = {http://dx.doi.org/10.1016/j.disc.2011.06.025},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Kyaw11},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {311},
number = {20},
pages = {2135-2142},
}