Polynomial graph-colorings (Q5096147): Difference between revisions

@@ Property / cites work @@
+The Complexity of Colouring by Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3758852
@@ Property / cites work: Q3758852 / 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 @@
+Colorings and interpretations: a connection between graphs and grammar forms
+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 @@
+Q3912037
@@ Property / cites work: Q3912037 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bfb0028977
+Normal rank
@@ Property / OpenAlex ID @@
+W1539999544
@@ Property / OpenAlex ID: W1539999544 / rank @@
+Normal rank