The C_k-extended graft construction
From MaRDI portal
Publication:2275937
Recommendations
Cites work
- Adjusted interval digraphs
- Classifying the Complexity of Constraints Using Finite Algebras
- Colouring, constraint satisfaction, and complexity
- Duality and Polynomial Testing of Tree Homomorphisms
- Existence theorems for weakly symmetric operations
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 866665 (Why is no real title available?)
- Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
- Minimum cost homomorphisms to semicomplete multipartite digraphs
- On the algebraic structure of combinatorial problems
- On the Structure of Polynomial Time Reducibility
- Polynomial graph-colorings
- The complexity of colouring by locally semicomplete digraphs
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The dichotomy of list homomorphisms for digraphs
- The effect of two cycles on the complexity of colourings by directed graphs
- Weak near-unanimity functions and digraph homomorphism problems
Cited in
(2)
This page was built for publication: The \(C_{k}\)-extended graft construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275937)