Pages that link to "Item:Q1127870"
From MaRDI portal
The following pages link to List homomorphisms to reflexive graphs (Q1127870):
Displaying 25 items.
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy (Q3522938) (← links)
- NU Polymorphisms on Reflexive Digraphs (Q4610183) (← links)
- Finding<i>H</i>-partitions efficiently (Q4680731) (← links)
- (Q4993594) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- (Q5005172) (← links)
- (Q5009627) (← links)
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
- (Q5075768) (← links)
- (Q5089181) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- Min-Orderable Digraphs (Q5130576) (← links)
- The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
- Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- (Q5874546) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
- Fanout limitations on constraint systems (Q5941073) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- (Q6065467) (← links)
- The complexity of the matroid homomorphism problem (Q6162136) (← links)
- (Q6185533) (← links)
- Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets (Q6573396) (← links)
