Rainbow connection number and connected dominating sets (Q2911064): Difference between revisions

@@ Property / OpenAlex ID @@
+W1535932596
@@ Property / OpenAlex ID: W1535932596 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2296
@@ Property / arXiv ID: 1010.2296 / rank @@
+Normal rank
@@ Property / cites work @@
+On rainbow connection
@@ Property / cites work: On rainbow connection / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness and Algorithms for Rainbow Connectivity
@@ Property / cites work: Hardness and Algorithms for Rainbow Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3525736
@@ Property / cites work: Q3525736 / rank @@
+Normal rank
@@ Property / cites work @@
+Asteroidal Triple-Free Graphs
@@ Property / cites work: Asteroidal Triple-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The rainbow connection of a graph is (at most) reciprocal to its minimum degree
+Normal rank
@@ Property / cites work @@
+The Complexity of the Partial Order Dimension Problem
+Normal rank