Dominating induced matchings in graphs without a skew star (Q2447537): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2013.11.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1996995804
@@ Property / OpenAlex ID: W1996995804 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth for graphs with small chordality
@@ Property / cites work: Treewidth for graphs with small chordality / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating induced matchings for \(P_7\)-free graphs in linear time
+Normal rank
@@ Property / cites work @@
+Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Dominating Induced Matchings
@@ Property / cites work: Dominating Induced Matchings / 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 @@
+On the complexity of the dominating induced matching problem in hereditary classes of graphs
+Normal rank
@@ Property / cites work @@
+Claw-free graphs. V. Global structure
@@ Property / cites work: Claw-free graphs. V. Global structure / rank @@
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Independence and upper irredundance in claw-free 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 @@
+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 stable cutsets in claw-free graphs and planar graphs
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
+Normal rank
@@ Property / cites work @@
+Solving the weighted efficient edge domination problem on bipartite permutation graphs
+Normal rank
@@ Property / cites work @@
+Perfect edge domination and efficient edge domination in graphs
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank