The following pages link to (Q5365149):
Displaying 17 items.
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- The \(C_{k}\)-extended graft construction (Q2275937) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- CSP for binary conservative relational structures (Q2634708) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- (Q5091252) (← links)
- The smallest hard trees (Q6073305) (← links)
