Publisher
Springer International Publishing
Reference12 articles.
1. Nikolopoulos, S.D., Palios, L., Papadopoulos, C.: Counting spanning trees in graphs using modular decomposition. In: Proceedings of WALCOM 2011. Lecture Notes in Computer Science, vol. 6552, pp. 202–213. Springer, Berlin (2011)
2. Goodrich, M.T., Tamassia, R.: Algorithm Design: Foundations, Analysis, and Internet Examples. Wiley, New York (2002)
3. Cayley, A.: A theorem on trees. Quart. J. Math. 23, 376–378 (1889)
4. Prüfer, H.: Neuer beweis eines satzes über permutationen. Arch. Math. Phys. 27, 142–144 (1918)
5. Clarke, L.E.: On Cayley’s formula for counting trees. J. London Math. Soc. 33, 471–474 (1958)