Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (Q300179): Difference between revisions

@@ Property / cites work @@
+New Hardness Results in Rainbow Connectivity
@@ Property / cites work: New Hardness Results in Rainbow Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / 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 @@
+Further hardness results on the rainbow vertex-connection number of graphs
+Normal rank
@@ Property / cites work @@
+The complexity of determining the rainbow vertex-connection of a graph
+Normal rank
@@ Property / cites work @@
+Rainbow connections of graphs: a survey
@@ Property / cites work: Rainbow connections of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+The rainbow connection of a graph is (at most) reciprocal to its minimum degree
+Normal rank