Boundary classes of graphs for the dominating set problem (Q1877644): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2004.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W1971868915
@@ Property / OpenAlex ID: W1971868915 / rank @@
+Normal rank
@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+Q4272117
@@ Property / cites work: Q4272117 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the number of cliques in a graph
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3353058
@@ Property / cites work: Q3353058 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing independent sets in graphs with large girth
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank