Pages that link to "Item:Q1686250"
From MaRDI portal
The following pages link to On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250):
Displaying 7 items.
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- CSP dichotomy for special polyads (Q2852579) (← links)
- Smooth digraphs modulo primitive positive constructability and cyclic loop conditions (Q4958331) (← links)
- (Q5267684) (← links)
- The smallest hard trees (Q6073305) (← links)