A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042): Difference between revisions

@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+NP-hard graph problems and boundary classes of graphs
+Normal rank
@@ Property / cites work @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Updating the complexity status of coloring graphs without a fixed induced linear forest
+Normal rank
@@ Property / cites work @@
+Q3676177
@@ Property / cites work: Q3676177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+List coloring in the absence of two subgraphs
@@ Property / cites work: List coloring in the absence of two subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+-coloring \(H\)-free graphs when \(H\) is small
@@ Property / cites work: 4-coloring \(H\)-free graphs when \(H\) is small / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of domination number determination in monogenic classes of graphs
+Normal rank
@@ Property / cites work @@
+Boundary properties of graphs for algorithmic graph problems
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Vertex coloring of graphs with few obstructions
@@ Property / cites work: Vertex coloring of graphs with few obstructions / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in extensions of 2\(K_{2}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Independent domination in finitely defined classes of graphs: polynomial algorithms
+Normal rank
@@ Property / cites work @@
+Boundary properties of the satisfiability problems
+Normal rank
@@ Property / cites work @@
+The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
+Normal rank
@@ Property / cites work @@
+The coloring problem for classes with two small obstructions
+Normal rank
@@ Property / cites work @@
+Q3115202
@@ Property / cites work: Q3115202 / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary graph classes for some maximum induced subgraph problems
+Normal rank
@@ Property / cites work @@
+The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+Q3115195
@@ Property / cites work: Q3115195 / rank @@
+Normal rank