On the complexity of H-coloring
Journal of Combinatorial Theory Series B
On the algebraic structure of combinatorial problems
Theoretical Computer Science
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
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
Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
First-Order Model Checking Problems Parameterized by the Model
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Relatively quantified constraint satisfaction
Constraints
The complexity of constraint satisfaction games and QCSP
Information and Computation
The lattice structure of sets of surjective hyper-operations
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters
QCSP on partially reflexive forests
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The Complexity of Positive First-Order Logic without Equality
ACM Transactions on Computational Logic (TOCL)
Meditations on quantified constraint satisfaction
Logic and Program Semantics
Containment, equivalence and coreness from CSP to QCSP and beyond
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Hell and Nešetřil proved that the H-colouring problem is NP-complete if, and only if, H is bipartite. In this paper, we investigate the complexity of the quantified H-colouring problem (a restriction of the quantified constraint satisfaction problem to undirected graphs). We introduce this problem using a new two player colouring game. We prove that the quantified H-colouring problem is: 1. tractable, if H is bipartite; 2. NP-complete, if H is not bipartite and not connected; and, 3. Pspace-complete, if H is connected and has a unique cycle, which is of odd length. We conjecture that the last case extends to all non-bipartite connected graphs.