… such as List H-Coloring, Counting H-Coloring, Restrictive H-Coloring has been
intensively … is the dichotomy theorem for undirected graphs [11] that establishes that the H-Coloring …

… toward a dichotomy classification of approximable cases. We give a dichotomy classification
… In Section 7, we show that the same dichotomy classification holds in terms of approximation…

… The main goal of our work is to start the development of some of the theories beyond the
CSP dichotomy theorem in bounded arithmetic. We aim eventually—in a subsequent work—to …

… For this reason, it makes sense to revisit the original proof of Hell and Nešetril for the
dichotomy for CSP for undirected graphs ([9]). In this paper we give new simpler proof of central …

… agreed with the more general constraint satisfaction problem (CSP) dichotomy … CSP
dichotomy classification conjecture was given. In this paper, we reprove the H-coloring dichotomy …

… (We remark that our results re-prove the L − NL dichotomy for LHOM(T) when T is an …
Descriptive complexity of list H-coloring problems in logspace: A refined dichotomy. In 30th Annual …

… The CSP dichotomy conjecture of Feder and Vardi is equivalent to proving that, for any H,
the H-coloring problem is in in P or NP-complete. We confirm this dichotomy for a certain class …

… We apply the main result to H-COLORING problem, an intensively studied combinatorial …
The result for SATISFIABILITY is known as Schaefer’s Dichotomy Theorem. We revisit those re…

… The CSP dichotomy conjecture of Feder and Vardi is equivalent to proving that, for any H,
the Hcoloring problem is in P or NP-complete. We confirm this dichotomy for a certain class of …

… We investigate the List H-Coloring problem, the generalization of graph … dichotomy,
Feder and Hell [14] proved that if H is reflexive (ie, every vertex has a self-loop), then List H-Coloring …