Publisher
Springer Nature Switzerland
Reference15 articles.
1. Azarija, J., Škrekovski, R.: Euler’s idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees. Mathematica Bohemica (2012)
2. Bogdanowicz, Z.R.: Formulas for the number of spanning trees in a fan. Appl. Math. Sci. 2(16), 781–786 (2008)
3. Cheng, C.S.: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory. J. Comb. Theor. Ser. B 31(2), 240–248 (1981)
4. Gilbert, B., Myrvold, W.: Maximizing spanning trees in almost complete graphs. Netw. Int. J. 30(1), 23–30 (1997)
5. Grenet, B., Kaltofen, E.L., Koiran, P., Portier, N.: Symmetric determinantal representation of weakly-skew circuits. In: Schwentick, T., Dürr, C. (eds.) 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. LIPIcs, vol. 9, pp. 543–554. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011). https://doi.org/10.4230/LIPIcs.STACS.2011.543