Partitioning the Vertices of a Graph into Two Total Dominating Sets (Q5236035): Difference between revisions

@@ Property / cites work @@
+Q4821937
@@ Property / cites work: Q4821937 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463534
@@ Property / cites work: Q5463534 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3158579
@@ Property / cites work: Q3158579 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
+Normal rank
@@ Property / cites work @@
+Approximating theDomatic Number
@@ Property / cites work: Approximating theDomatic Number / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4209364
@@ Property / cites work: Q4209364 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3070350
@@ Property / cites work: Q3070350 / rank @@
+Normal rank
@@ Property / cites work @@
+Total Domination in Graphs
@@ Property / cites work: Total Domination in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3291034
@@ Property / cites work: Q3291034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4206780
@@ Property / cites work: Q4206780 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4378635
@@ Property / cites work: Q4378635 / rank @@
+Normal rank