Connected domination in maximal outerplanar graphs (Q2192107): Difference between revisions

@@ Property / cites work @@
+Matching properties in connected domination critical graphs
+Normal rank
@@ Property / cites work @@
+Q2839672
@@ Property / cites work: Q2839672 / rank @@
+Normal rank
@@ Property / cites work @@
+On the secure domination numbers of maximal outerplanar graphs
+Normal rank
@@ Property / cites work @@
+On dominating sets of maximal outerplanar graphs
@@ Property / cites work: On dominating sets of maximal outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the connected domination number of a graph
+Normal rank
@@ Property / cites work @@
+Connected Domination Stable Graphs Upon Edge Addition
+Normal rank
@@ Property / cites work @@
+Total domination in maximal outerplanar graphs. II.
+Normal rank
@@ Property / cites work @@
+Total domination in maximal outerplanar graphs
@@ Property / cites work: Total domination in maximal outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connected domination of regular graphs
@@ Property / cites work: Connected domination of regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
+Normal rank
@@ Property / cites work @@
+Connected domination number of a graph and its complement
+Normal rank
@@ Property / cites work @@
+On dominating sets of maximal outerplanar and planar graphs
+Normal rank
@@ Property / cites work @@
+Dominating sets in planar graphs
@@ Property / cites work: Dominating sets in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the maximum leaf spanning tree problem on planar and regular graphs
+Normal rank
@@ Property / cites work @@
+Q3895508
@@ Property / cites work: Q3895508 / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs for which the connected domination number is at most the total domination number
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
+Normal rank
@@ Property / cites work @@
+Dominating sets of maximal outerplanar graphs
@@ Property / cites work: Dominating sets of maximal outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
+Normal rank