Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392): Difference between revisions

@@ Property / cites work @@
+Perfect codes in graphs
@@ Property / cites work: Perfect codes in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Dominating induced matchings for \(P_7\)-free graphs in linear time
+Normal rank
@@ Property / cites work @@
+Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+On the complexity of the dominating induced matching problem in hereditary classes of graphs
+Normal rank
@@ Property / cites work @@
+Efficient edge domination problems in graphs
@@ Property / cites work: Efficient edge domination problems in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating induced matchings in graphs containing no long claw
+Normal rank
@@ Property / cites work @@
+Dominating induced matchings in graphs without a skew star
+Normal rank
@@ Property / cites work @@
+Perfect edge domination and efficient edge domination in graphs
+Normal rank
@@ Property / cites work @@
+Solving the weighted efficient edge domination problem on bipartite permutation graphs
+Normal rank