BibTeX record journals/corr/abs-0912-3802

download as .bib file

@article{DBLP:journals/corr/abs-0912-3802,
  author       = {L{\'{a}}szl{\'{o}} Egri and
                  Andrei A. Krokhin and
                  Beno{\^{\i}}t Larose and
                  Pascal Tesson},
  title        = {The complexity of the list homomorphism problem for graphs},
  journal      = {CoRR},
  volume       = {abs/0912.3802},
  year         = {2009},
  url          = {http://arxiv.org/abs/0912.3802},
  eprinttype    = {arXiv},
  eprint       = {0912.3802},
  timestamp    = {Mon, 08 Jul 2019 12:14:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0912-3802.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.