On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Closure properties of constraints
Journal of the ACM (JACM)
Theories of computability
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Constraints, consistency and closure
Artificial Intelligence
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On sparse graphs with given colorings and homomorphisms
Journal of Combinatorial Theory Series B
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
Graphs, polymorphisms and the complexity of homomorphism problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A New Proof of the $H$-Coloring Dichotomy
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
H-colorings of dense hypergraphs
Information Processing Letters
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |
The H-Coloring problem can be expressed as a particular case of the constraint satisfaction problem (CSP) whose computational complexity has been intensively studied under various approaches in the last several years. We show that the dichotomy theorem proved by Hell and Nešetřil [On the complexity of H-coloring, J. Combin. Theory Ser. B 48 (1990) 92-110] for the complexity of the H-Coloring problem for undirected graphs can be obtained using general methods for studying CSP and that the criterion distinguishing the tractable cases of the H-Coloring problem agrees with that conjectured in [A.A. Bulatov, P.G. Jeavons, A.A. Krokhin, Constraint satisfaction problems and finite algebras, in: Proc. 27th Internat. Colloq. on Automata, Languages and Programming--ICALP'00, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 272-282] for the complexity of the general CSP.