"The average number of spanning trees in sparse graphs with given degrees."

Catherine S. Greenhill et al. (2017)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2017.02.003

access: closed

type: Journal Article

metadata version: 2024-09-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejc/GreenhillIKM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/GreenhillIKM17
Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay:
The average number of spanning trees in sparse graphs with given degrees. Eur. J. Comb. 63: 6-25 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.