Cite
HARVARD Citation
Greenhill, C. et al. (2017). The average number of spanning trees in sparse graphs with given degrees. European journal of combinatorics. pp. 6-25. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Greenhill, C. et al. (2017). The average number of spanning trees in sparse graphs with given degrees. European journal of combinatorics. pp. 6-25. [Online].