Pages that link to "Item:Q911612"

The following pages link to The effect of two cycles on the complexity of colourings by directed graphs (Q911612):

Displaying 23 items.

• Colouring, constraint satisfaction, and complexity (Q458466) (← links)
• Rigid binary relations on a 4-element domain (Q523155) (← links)
• On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
• The core of a graph (Q686290) (← links)
• The complexity of colouring by locally semicomplete digraphs (Q709314) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← links)
• List homomorphisms to reflexive graphs (Q1127870) (← links)
• Homomorphisms to oriented cycles (Q1316647) (← links)
• The complexity of colouring symmetric relational systems (Q1327221) (← links)
• Graph homomorphisms with infinite targets (Q1336635) (← links)
• Homomorphisms to oriented paths (Q1336655) (← links)
• Colorings and girth of oriented planar graphs (Q1356774) (← links)
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs (Q1421519) (← links)
• Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
• Complexity of tree homomorphisms (Q1923593) (← links)
• The complexity of tropical graph homomorphisms (Q2012054) (← links)
• The \(C_{k}\)-extended graft construction (Q2275937) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← links)
• The recognition of bound quivers using edge-coloured homomorphisms (Q2566139) (← links)
• CSP dichotomy for special triads (Q3395563) (← links)
• Path homomorphisms (Q4892428) (← links)
• Testing subgraphs in directed graphs (Q5917574) (← links)