Pages that link to "Item:Q3113761"
From MaRDI portal
The following pages link to The complexity of the list homomorphism problem for graphs (Q3113761):
Displaying 20 items.
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- Complexity of homomorphisms to direct products of graphs (Q1603497) (← links)
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem (Q1869963) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- List homomorphisms and circular arc graphs (Q1977431) (← links)
- The complexity of homomorphism factorization (Q2046363) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- A generalization of the theorem of Lekkerkerker and Boland (Q2568478) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- (Q3304125) (← links)
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy (Q3522938) (← links)
- Bi‐arc graphs and the complexity of list homomorphisms (Q4798127) (← links)