Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Fernandes, L.M., Gouvea, L.: Spanning trees with a constraint on the number of leaves. Eur. J. Oper. Res. 1104, 250–261 (1998)
2. Mukwembi, S.: Minimum degree, leaf number and traceability. CMJ 63(138), 539–545 (2013)
3. Goodman, S., Hedetniemi, S.: Sufficient conditions for a graph to be Hamiltonian. J. Comb. Theory Ser. B 16, 175–180 (1974)
4. Storer, J.A.: Constructing full spanning trees for cubic graphs. Inf. Process Lett 13, 8–11 (1981)
5. Mukwembi, S.: Minimum degree, leaf number, and Hamiltonicity. Am. Math. Mon. 120(02), 115 (2013)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献