Hereditarily hard \(H\)-colouring problems (Q1842146): Difference between revisions

@@ Property / author @@
-Jörgen Bang-Jensen
@@ Property / author: Jörgen Bang-Jensen / rank @@
-Normal rank
@@ Property / author @@
-Q790131
@@ Property / author: Q790131 / rank @@
-Normal rank
@@ Property / author @@
+Jörgen Bang-Jensen
@@ Property / author: Jörgen Bang-Jensen / rank @@
+Normal rank
@@ Property / author @@
+Pavol Hell
@@ Property / author: Pavol Hell / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+On the complexity of colouring by superdigraphs of bipartite graphs
+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 @@
+On minimal graphs
@@ Property / cites work: On minimal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / 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 @@
+Homomorphisms to oriented paths
@@ Property / cites work: Homomorphisms to oriented paths / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
+Normal rank
@@ Property / cites work @@
+Graph homomorphisms with infinite targets
@@ Property / cites work: Graph homomorphisms with infinite targets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873684
@@ Property / cites work: Q4873684 / rank @@
+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 @@
+Colorings and interpretations: a connection between graphs and grammar forms
+Normal rank
@@ Property / cites work @@
+Q3912037
@@ Property / cites work: Q3912037 / rank @@
+Normal rank
@@ Property / cites work @@
+On classes of relations and graphs determined by subobjects and factorobjects
+Normal rank
@@ Property / cites work @@
+Color-families are dense
@@ Property / cites work: Color-families are dense / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(94)00189-p
+Normal rank
@@ Property / OpenAlex ID @@
+W2052903450
@@ Property / OpenAlex ID: W2052903450 / rank @@
+Normal rank