Pages that link to "Item:Q686279"
From MaRDI portal
The following pages link to On the complexity of colouring by superdigraphs of bipartite graphs (Q686279):
Displaying 9 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- The effect of two cycles on the complexity of colourings by directed graphs (Q911612) (← links)
- On the algebraic structure of combinatorial problems (Q1276253) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- Graph homomorphisms with infinite targets (Q1336635) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
