Generalisations of matrix partitions: complexity and obstructions

Cites Work

The complexity of homomorphism and constraint satisfaction problems seen from the other side
Title not available (Why is that?)
On the complexity of H-coloring
Graph structure and monadic second-order logic. A language-theoretic approach
Expander graphs and their applications
A dichotomy theorem for constraint satisfaction problems on a 3-element set
On the Structure of Polynomial Time Reducibility
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
The complexity of surjective homomorphism problems-a survey
Classifying the Complexity of Constraints Using Finite Algebras
The complexity of satisfiability problems
On the algebraic structure of combinatorial problems
The complexity of conservative valued CSPs
On digraph coloring problems and treewidth duality
List Partitions
On realizations of point determining graphs, and obstructions to full homomorphisms
Graph partitions with prescribed patterns
Colourings, homomorphisms, and partitions of transitive digraphs
Graph complexity
Matrix partitions with finitely many obstructions
The dichotomy of list homomorphisms for digraphs
Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
A finer reduction of constraint problems to digraphs
The number of submatrices of a given type in a Hadamard matrix and related results
The complexity of locally injective homomorphisms
Matrix partitions of split graphs
Dualities in full homomorphisms
A closed set of normal orthogonal functions.
A proof of the CSP dichotomy conjecture
On the density of trigraph homomorphisms
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
QCSP Monsters and the Demise of the Chen Conjecture

This page was built for publication: Generalisations of matrix partitions: complexity and obstructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564025)