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]

Abstract

Abstract is missing.