A note on the complexity of the chromatic number problem (Q1229753): Difference between revisions

@@ Property / cites work @@
+Chromatic Scheduling and the Chromatic Number Problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for Determining the Chromatic Number of a Graph
+Normal rank
@@ Property / cites work @@
+An algorithm for the chromatic number of a graph
@@ Property / cites work: An algorithm for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083457
@@ Property / cites work: Q4083457 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Near-Optimal Graph Coloring
@@ Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Q5670645
@@ Property / cites work: Q5670645 / rank @@
+Normal rank
@@ Property / cites work @@
+Corrections to Bierstone's Algorithm for Generating Cliques
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Chromatic Number of a Graph
@@ Property / cites work: An Algorithm for the Chromatic Number of a Graph / rank @@
+Normal rank