Pages that link to "Item:Q714844"
From MaRDI portal
The following pages link to Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844):
Displayed 4 items.
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)