Funder
Japan Society for the Promotion of Science
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Aung, M., Kyaw, A.: Maximum trees with bounded maximum degree in a graph. Graphs Combin. 14, 209–221 (1998)
2. Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111–135 (1976)
3. Broersma, H.J., Tuinstra, H.: Independence trees and hamilton cycles. J. Graph Theory 29, 227–237 (1998)
4. Broersma, H.J., Ryjáček, Z., Schiermeyer, I.: Closure concepts: a survey. Graphs Combin. 16, 17–48 (2000)
5. Enomoto, H., Ohnishi, Y., Ota, K.: Spanning trees with bounded total excess. Ars Combin. 102, 289–295 (2011)