The Maximum Number of Dominating Induced Matchings (Q4982287): Difference between revisions

@@ Property / cites work @@
+Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Dominating Induced Matchings for P 7-free Graphs in Linear Time
+Normal rank
@@ Property / cites work @@
+Efficient edge domination in regular graphs
@@ Property / cites work: Efficient edge domination in regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the dominating induced matching problem in hereditary classes of graphs
+Normal rank
@@ Property / cites work @@
+Dominating Induced Matchings
@@ Property / cites work: Dominating Induced Matchings / rank @@
+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 @@
+A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs
+Normal rank
@@ Property / cites work @@
+An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching
+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