Funder
Australian Research Council Discovery Project
Subject
Discrete Mathematics and Combinatorics
Reference18 articles.
1. The number of spanning trees in regular graphs;Alon;Random Structures Algorithms,1990
2. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs;Bollobás;European J. Combin.,1980
3. Coverings, heat kernels and spanning trees;Chung;Electron. J. Combin.,1999
4. Martingales on trees and the empire chromatic number of random trees;Cooper,2009
5. Perfect matchings in random graphs with prescribed minimal degree;Frieze,2004
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献