Enumerating maximal independent sets with applications to graph colouring. (Q703280): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2004.03.002
@@ Property / DOI: 10.1016/j.orl.2004.03.002 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+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 @@
+Q3946192
@@ Property / cites work: Q3946192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768314
@@ Property / cites work: Q2768314 / rank @@
+Normal rank
@@ Property / cites work @@
+Small Maximal Independent Sets and Faster Exact Graph Coloring
+Normal rank
@@ Property / cites work @@
+The Number of Maximal Independent Sets in Triangle-Free Graphs
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the chromatic number problem
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4882469
@@ Property / cites work: Q4882469 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2004.03.002
@@ Property / DOI: 10.1016/J.ORL.2004.03.002 / rank @@
+Normal rank