Author:
Correa José R.,Fernandes Cristina G.,Matamala Martín,Wakabayashi Yoshiko
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Bonsma, P.: Spanning trees with many leaves: new extremal results and an improved FPT algorithm. Technical report, Faculty of EEMCS, University of Twente, The Netherlands (2006)
2. Galbiati, G., Maffioli, F., Morzenti, A.: A short note on the approximability of the maximum leaves spanning tree problem. Information Processing Letters 52(1), 45–49 (1994)
3. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
4. Griggs, J., Kleitman, D., Shastri, A.: Spanning trees with many leaves in cubic graphs. Journal of Graph Theory 13(6), 669–695 (1989)
5. Kleitman, D., West, D.: Spanning trees with many leaves. SIAM Journal on Discrete Mathematics 4(1), 99–106 (1991)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献