BibTeX record journals/dm/EschenHSS11

download as .bib file

@article{DBLP:journals/dm/EschenHSS11,
  author       = {Elaine M. Eschen and
                  Ch{\'{\i}}nh T. Ho{\`{a}}ng and
                  R. Sritharan and
                  Lorna Stewart},
  title        = {On the complexity of deciding whether the distinguishing chromatic
                  number of a graph is at most two},
  journal      = {Discret. Math.},
  volume       = {311},
  number       = {6},
  pages        = {431--434},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.disc.2010.12.013},
  doi          = {10.1016/J.DISC.2010.12.013},
  timestamp    = {Fri, 12 Feb 2021 13:46:01 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/EschenHSS11.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.