The following pages link to (Q3490042):
Displaying 13 items.
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- On the complexity of some problems related to graph extensions (Q650325) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Weak near-unanimity functions and digraph homomorphism problems (Q1945940) (← links)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
- The complexity of counting homomorphisms to cactus graphs modulo 2 (Q2828223) (← links)
- The complexity of homomorphism and constraint satisfaction problems seen from the other side (Q3546332) (← links)
- (Q3615792) (← links)
- Nonuniform complexity classes, decision graphs and homological properties of posets (Q3741053) (← links)
- (Q4432211) (← links)
- Bi‐arc graphs and the complexity of list homomorphisms (Q4798127) (← links)
- (Q5144653) (← links)
- Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs (Q5146875) (← links)