Rainbow connection number and radius (Q742568): Difference between revisions

@@ Property / author @@
-Manu Basavaraju
@@ Property / author: Manu Basavaraju / rank @@
-Normal rank
@@ Property / author @@
+Manu Basavaraju
@@ Property / author: Manu Basavaraju / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1651744655
@@ Property / OpenAlex ID: W1651744655 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0620
@@ Property / arXiv ID: 1011.0620 / 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 @@
+Q2857351
@@ Property / cites work: Q2857351 / 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 @@
+Rainbow connection number, bridges and radius
@@ Property / cites work: Rainbow connection number, bridges and radius / 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 @@
+Rainbow connection number and connectivity
@@ Property / cites work: Rainbow connection number and connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+A note on finding the bridges of a graph
@@ Property / cites work: A note on finding the bridges of a graph / rank @@
+Normal rank