Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-016-0150-y
@@ Property / DOI: 10.1007/s00453-016-0150-y / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6710377
@@ Property / zbMATH DE Number: 6710377 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dominating induced matching
@@ Property / zbMATH Keywords: dominating induced matching / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+efficient edge domination
@@ Property / zbMATH Keywords: efficient edge domination / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(P_8\)-free graphs
@@ Property / zbMATH Keywords: \(P_8\)-free graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial time algorithm
@@ Property / zbMATH Keywords: polynomial time algorithm / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2342665464
@@ Property / OpenAlex ID: W2342665464 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00978
@@ Property / arXiv ID: 1908.00978 / rank @@
+Normal rank
@@ 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 @@
+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 @@
+Finding a maximum induced matching in weakly chordal graphs
+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
@@ Property / cites work @@
+Algorithms for weakly triangulated graphs
@@ Property / cites work: Algorithms for weakly triangulated graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-016-0150-Y
@@ Property / DOI: 10.1007/S00453-016-0150-Y / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:524382