Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870): Difference between revisions

@@ 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 @@
+Colorful monochromatic connectivity
@@ Property / cites work: Colorful monochromatic connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with rainbow connection number two
@@ Property / cites work: Graphs with rainbow connection number two / 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 @@
+Note on minimally \(d\)-rainbow connected graphs
@@ Property / cites work: Note on minimally \(d\)-rainbow connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection number of dense graphs
@@ Property / cites work: Rainbow connection number of dense graphs / rank @@
+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 @@
+A note on the minimum size of \(k\)-rainbow-connected graphs
+Normal rank
@@ Property / cites work @@
+On minimally rainbow \(k\)-connected graphs
@@ Property / cites work: On minimally rainbow \(k\)-connected graphs / rank @@
+Normal rank