BibTeX record journals/dm/BrewsterFHN17

download as .bib file

@article{DBLP:journals/dm/BrewsterFHN17,
  author       = {Richard C. Brewster and
                  Florent Foucaud and
                  Pavol Hell and
                  Reza Naserasr},
  title        = {The complexity of signed graph and edge-coloured graph homomorphisms},
  journal      = {Discret. Math.},
  volume       = {340},
  number       = {2},
  pages        = {223--235},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.disc.2016.08.005},
  doi          = {10.1016/J.DISC.2016.08.005},
  timestamp    = {Sat, 22 Feb 2020 14:01:43 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BrewsterFHN17.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.