Pages that link to "Item:Q4889961"
From MaRDI portal
The following pages link to Duality and Polynomial Testing of Tree Homomorphisms (Q4889961):
Displaying 37 items.
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- No finite-infinite antichain duality in the homomorphism poset of directed graphs (Q603883) (← links)
- Dualities and dual pairs in Heyting algebras (Q603889) (← links)
- Residual properties of pre-bipartite digraphs (Q616134) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs (Q1421519) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- Universal partial order represented by means of oriented trees and other simple graphs (Q1775038) (← links)
- A note on maxflow-mincut and homomorphic equivalence in matroids (Q1840660) (← links)
- Duality theorems for finite structures (characterising gaps and good characterisations) (Q1850486) (← links)
- Density via duality. (Q1853500) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- The \(C_{k}\)-extended graft construction (Q2275937) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
- Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties. (Q2510719) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- The complexity of partition functions (Q2581263) (← links)
- CSP dichotomy for special triads (Q3395563) (← links)
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions (Q4958331) (← links)
- Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) (← links)
- Classification of a Class of Counting Problems Using Holographic Reductions (Q5323095) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- Finite paths are universal (Q5920532) (← links)
- Finite paths are universal (Q5921694) (← links)
- The smallest hard trees (Q6073305) (← links)
- Semidefinite programming and its applications to NP problems (Q6085755) (← links)
