Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134): Difference between revisions

@@ Property / cites work @@
+The effect of two cycles on the complexity of colourings by directed graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Colouring by Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Q5715675
@@ Property / cites work: Q5715675 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A dichotomy for minimum cost graph homomorphisms
@@ Property / cites work: A dichotomy for minimum cost graph homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cost and list homomorphisms to semicomplete digraphs
+Normal rank
@@ Property / cites work @@
+Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
+Normal rank
@@ Property / cites work @@
+Level of repair analysis and minimum cost homomorphisms of graphs
+Normal rank
@@ Property / cites work @@
+Polynomial graph-colorings
@@ Property / cites work: Polynomial graph-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4432211
@@ Property / cites work: Q4432211 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank