A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593): Difference between revisions

@@ Property / cites work @@
+Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+New Polynomial Cases of the Weighted Efficient Domination Problem
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Hereditary Efficiently Dominatable Graphs
@@ Property / cites work: Hereditary Efficiently Dominatable Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time
+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 @@
+Q4390693
@@ Property / cites work: Q4390693 / rank @@
+Normal rank