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 8 items.
- 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)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- (Q5874546) (← links)
- (Q6065467) (← links)
- Vertex ordering with precedence constraints (Q6546603) (← links)
