BibTeX record journals/rsa/DyerG00

download as .bib file

@article{DBLP:journals/rsa/DyerG00,
  author       = {Martin E. Dyer and
                  Catherine S. Greenhill},
  title        = {The complexity of counting graph homomorphisms},
  journal      = {Random Struct. Algorithms},
  volume       = {17},
  number       = {3-4},
  pages        = {260--289},
  year         = {2000},
  url          = {https://doi.org/10.1002/1098-2418(200010/12)17:3/4\<260::AID-RSA5\>3.0.CO;2-W},
  doi          = {10.1002/1098-2418(200010/12)17:3/4\<260::AID-RSA5\>3.0.CO;2-W},
  timestamp    = {Fri, 26 May 2017 22:50:39 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/DyerG00.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.