Pages that link to "Item:Q1842146"
From MaRDI portal
The following pages link to Hereditarily hard \(H\)-colouring problems (Q1842146):
Displaying 11 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- The effect of two cycles on the complexity of colourings by directed graphs (Q911612) (← links)
- On the restricted homomorphism problem (Q948709) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
