On the complexity of colouring by superdigraphs of bipartite graphs (Q686279): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3758851
@@ Property / cites work: Q3758851 / rank @@
+Normal rank
@@ 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 @@
+Hereditarily hard \(H\)-colouring problems
@@ Property / cites work: Hereditarily hard \(H\)-colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+On unavoidable digraphs in orientations of graphs
@@ Property / cites work: On unavoidable digraphs in orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Contractibility and NP-completeness
@@ Property / cites work: Contractibility and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial graph-colorings
@@ Property / cites work: Polynomial graph-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+On multiplicative graphs and the product conjecture
+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 @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+On classes of relations and graphs determined by subobjects and factorobjects
+Normal rank
@@ Property / cites work @@
+On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
+Normal rank
@@ Property / cites work @@
+On the complexity of the general coloring problem
@@ Property / cites work: On the complexity of the general coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Color-families are dense
@@ Property / cites work: Color-families are dense / rank @@
+Normal rank