Author:
Wu Ro-Yu,Tseng Cheng-Chia,Hung Ling-Ju,Chang Jou-Ming
Publisher
Springer International Publishing
Reference20 articles.
1. Bogdanowicz, Z.R.: Formulas for the number of spanning trees in a fan. Appl. Math. Sci. 2(16), 781–786 (2008)
2. Lecture Notes in Computer Science;B Cameron,2021
3. Chakraborty, M., Chowdhury, S., Chakraborty, J., Mehera, R., Pal, R.K.: Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review. Complex Intell. Syst. 5(3), 265–281 (2019). https://doi.org/10.1007/s40747-018-0079-7
4. Chang, Y.-H., Wu, R.-Y., Lin, C.-K., Chang, J.-M.: A loopless algorithm for generating $$(k, m)$$-ary trees in gray code order. Optim. Lett. 15(4), 1133–1154 (2021). https://doi.org/10.1007/s11590-020-01613-z
5. Colbourn, C.J., Day, R.P., Nel, L.D.: Unranking and ranking spanning trees of a graph. J. Algorithms 10(2), 271–286 (1989)