Pages that link to "Item:Q693060"
From MaRDI portal
The following pages link to The complexity of the list homomorphism problem for graphs (Q693060):
Displaying 20 items.
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- Complexity of homomorphisms to direct products of graphs (Q1603497) (← links)
- List homomorphisms and circular arc graphs (Q1977431) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- A generalization of the theorem of Lekkerkerker and Boland (Q2568478) (← links)
- The complexity of the list homomorphism problem for graphs (Q3113761) (← links)
- (Q3304125) (← links)
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy (Q3522938) (← links)
- Bi‐arc graphs and the complexity of list homomorphisms (Q4798127) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- (Q5874546) (← links)
- (Q6065467) (← links)
- Vertex ordering with precedence constraints (Q6546603) (← links)