BibTeX record journals/ejc/GreenhillIKM17

download as .bib file

@article{DBLP:journals/ejc/GreenhillIKM17,
  author       = {Catherine S. Greenhill and
                  Mikhail Isaev and
                  Matthew Kwan and
                  Brendan D. McKay},
  title        = {The average number of spanning trees in sparse graphs with given degrees},
  journal      = {Eur. J. Comb.},
  volume       = {63},
  pages        = {6--25},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ejc.2017.02.003},
  doi          = {10.1016/J.EJC.2017.02.003},
  timestamp    = {Thu, 23 Jun 2022 20:04:35 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/GreenhillIKM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.