On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179): 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 @@
+Q4425939
@@ Property / cites work: Q4425939 / rank @@
+Normal rank
@@ Property / cites work @@
+The induced matching and chain subgraph cover problems for convex bipartite graphs
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463359
@@ Property / cites work: Q5463359 / rank @@
+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 @@
+Dominating Induced Matchings
@@ Property / cites work: Dominating Induced Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings in intersection graphs.
@@ Property / cites work: Induced matchings in intersection graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum induced matching in weakly chordal graphs
+Normal rank
@@ Property / cites work @@
+Induced matchings in asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Irredundancy in circular arc graphs
@@ Property / cites work: Irredundancy in circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New results on induced matchings
@@ Property / cites work: New results on induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / 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 @@
+Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
+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 @@
+Regular codes in regular graphs are difficult
@@ Property / cites work: Regular codes in regular graphs are difficult / rank @@
+Normal rank
@@ Property / cites work @@
+On maximum induced matchings in bipartite graphs
@@ Property / cites work: On maximum induced matchings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on graphs without long induced paths
@@ Property / cites work: Some results on graphs without long induced paths / rank @@
+Normal rank
@@ Property / cites work @@
+On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
+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
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank