The following pages link to Retractions to Pseudoforests (Q3084215):
Displaying 18 items.
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- A retraction problem in graph theory (Q1073052) (← links)
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Retractions onto series-parallel posets (Q2483392) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- Surjective \texttt{H}-colouring over reflexive digraphs (Q3304148) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- (Q5091252) (← links)
- The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
- Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) (← links)
