Pages that link to "Item:Q3977296"
From MaRDI portal
The following pages link to On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs (Q3977296):
Displaying 11 items.
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- Graph homomorphisms with infinite targets (Q1336635) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Recolouring reflexive digraphs (Q1744757) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- The recognition of bound quivers using edge-coloured homomorphisms (Q2566139) (← links)
- \(\gamma \)-cycles and transitivity by monochromatic paths in arc-coloured digraphs (Q2857026) (← links)
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (Q3569078) (← links)
- Further effects of two directed cycles on the complexity of \(H\)- colouring (Q3987041) (← links)