Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference26 articles.
1. Fractional DP-colorings of sparse graphs;Bernshteyn;J. Graph Theory,2019
2. A complexity dichotomy for signed H-colouring;Brewster;Discrete Math.,2018
3. A.A. Bulatov, A dichotomy theorem for non-uniform CSP’s, in: 58th Annual IEEE FOCS 2017.
4. Complexity of cnservative constraint satisfaction problems;Bulatov;ACM Trans. Comput. Log.,2011
5. J.Y. Cai, X. Chen, P.Y. Lu, Graph homomorphisms with complex values: a dichotomy theorem, ICALP 2010, pp. 275–286.