Author:
Srithus Ratana,Chotwattakawanit Udom
Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference26 articles.
1. Atserias A.: On digraph coloring problems and treewidth duality. European J. Combin. 29, 796–820 (2008)
2. Barto, L., Kozik, M., Niven, T.: Graphs, polymorphisms and the complexity of homomorphism problems. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC), pp. 789–796 (2008)
3. Bulatov A.: H-coloring dichotomy revisited. Theoret. Comput. Sci. 349, 31–39 (2005)
4. Bulatov A., Jeavons P., Krokhin A.: Classifying complexity of constraints using finite algebras. SIAM J. Comput. 34, 720–742 (2005)
5. Clark, D.M., Davey, B.A.: Natural Dualities for the Working Algebraist. Cambridge Studies in Advanced Mathematics, vol. 57. Cambridge University Press, Cambridge (1998)