Dalmau, Victor; Egri, Laszló; Hell, Pavol; Larose, Benoît; Rafiey, Arash Descriptive complexity of list H-coloring problems in logspace: a refined dichotomy. (English) Zbl 1401.68104 Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6–10, 2015. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4799-8875-4). 487-498 (2015). Cited in 5 Documents MSC: 68Q19 Descriptive complexity and finite models 68Q25 Analysis of algorithms and problem complexity Citations:Zbl 0914.68075; Zbl 1351.68113; Zbl 1172.68024 PDFBibTeX XMLCite \textit{V. Dalmau} et al., in: Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6--10, 2015. Los Alamitos, CA: IEEE Computer Society. 487--498 (2015; Zbl 1401.68104) Full Text: DOI