Duality and Polynomial Testing of Tree Homomorphisms
From MaRDI portal
Recommendations
Cited in
(46)- A surprising permanence of old motivations (a not-so-rigid story)
- List homomorphisms to reflexive graphs
- Colorings and girth of oriented planar graphs
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- On universal graphs for planar oriented graphs of a given girth
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
- Universal partial order represented by means of oriented trees and other simple graphs
- A note on maxflow-mincut and homomorphic equivalence in matroids
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Density via duality.
- Complexity of tree homomorphisms
- Dichotomy for tree-structured trigraph list homomorphism problems
- The \(C_{k}\)-extended graft construction
- On digraph coloring problems and treewidth duality
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Forbidden lifts (NP and CSP for combinatorialists)
- Graph partitions with prescribed patterns
- Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
- Dichotomy for finite tournaments of mixed-type
- The recognition of bound quivers using edge-coloured homomorphisms
- The complexity of partition functions
- CSP dichotomy for special triads
- Adjoint functors and tree duality
- Algorithms for partition of some class of graphs under compaction and vertex-compaction
- scientific article; zbMATH DE number 2061631 (Why is no real title available?)
- Colouring, constraint satisfaction, and complexity
- scientific article; zbMATH DE number 878894 (Why is no real title available?)
- scientific article; zbMATH DE number 932194 (Why is no real title available?)
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
- Polynomial graph-colorings
- Quantified constraint satisfaction problem on semicomplete digraphs
- Classification of a Class of Counting Problems Using Holographic Reductions
- Dualities for Constraint Satisfaction Problems
- Finite paths are universal
- Finite paths are universal
- No finite-infinite antichain duality in the homomorphism poset of directed graphs
- Dualities and dual pairs in Heyting algebras
- The smallest hard trees
- Semidefinite programming and its applications to NP problems
- Residual properties of pre-bipartite digraphs
- Symmetric linear arc monadic Datalog and gadget reductions
- Symmetric linear arc monadic Datalog and gadget reductions
- The complexity of list edge-partitions for simple graphs
- \(H\)-coloring degree-bounded (acyclic) digraphs
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- A new line of attack on the dichotomy conjecture
This page was built for publication: Duality and Polynomial Testing of Tree Homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889961)
