Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy

Víctor Dalmau, László Egri, Pavol Hell, Benoit Larose, Arash Rafiey. Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. pages 487-498, IEEE, 2015. [doi]

@inproceedings{DalmauEHLR15,
  title = {Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy},
  author = {Víctor Dalmau and László Egri and Pavol Hell and Benoit Larose and Arash Rafiey},
  year = {2015},
  doi = {10.1109/LICS.2015.52},
  url = {http://dx.doi.org/10.1109/LICS.2015.52},
  researchr = {https://researchr.org/publication/DalmauEHLR15},
  cites = {0},
  citedby = {0},
  pages = {487-498},
  booktitle = {30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015},
  publisher = {IEEE},
  isbn = {978-1-4799-8875-4},
}