Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760): Difference between revisions

@@ Property / cites work @@
+Complexity of distance paired-domination problem in graphs
+Normal rank
@@ Property / cites work @@
+Labelling algorithms for paired-domination problems in block and interval graphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for paired-domination problem in strongly chordal graphs
+Normal rank
@@ Property / cites work @@
+Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
+Normal rank
@@ Property / cites work @@
+Labelling Graphs with a Condition at Distance 2
@@ Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Paired-domination in graphs
@@ Property / cites work: Paired-domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
+Normal rank
@@ Property / cites work @@
+The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
+Normal rank
@@ Property / cites work @@
+\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
+Normal rank
@@ Property / cites work @@
+Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
+Normal rank