Chan, Swee Hong; Pak, Igor Computational complexity of counting coincidences. (English) Zbl 07921846 Theor. Comput. Sci. 1015, Article ID 114776, 19 p. (2024). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Dutta, Apratim; Muthu, Rahul; Tawari, Anuj; Sunitha, V. Exactly \(k\) MSTs: How many vertices suffice? (English) Zbl 07914059 Wu, Weili (ed.) et al., Combinatorial optimization and applications. 16th international conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 14461, 94-106 (2024). MSC: 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Stong, Richard Minimal graphs with a prescribed number of spanning trees. (English) Zbl 1490.05127 Australas. J. Comb. 82, Part 2, 182-196 (2022). MSC: 05C35 05C05 × Cite Format Result Cite Review PDF Full Text: Link Backlinks: MO MO
Glass, Darren; Kaplan, Nathan Chip-firing games and critical groups. (English) Zbl 1447.05135 Harris, Pamela E. (ed.) et al., A project-based guide to undergraduate research in mathematics. Starting and sustaining accessible undergraduate research. Cham: Birkhäuser. Found. Undergrad. Res. Math., 107-152 (2020). MSC: 05C57 05C40 05C70 91A43 20K01 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Azarija, Jernej Counting graphs with different numbers of spanning trees through the counting of prime partitions. (English) Zbl 1340.05006 Czech. Math. J. 64, No. 1, 31-35 (2014). MSC: 05A16 05C35 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link