Rainbow connection in 3-connected graphs (Q367069): Difference between revisions

@@ Property / author @@
-Xue Liang Li
@@ Property / author: Xue Liang Li / rank @@
-Normal rank
@@ Property / author @@
+Xue Liang Li
@@ Property / author: Xue Liang Li / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2137874848
@@ Property / OpenAlex ID: W2137874848 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6131
@@ Property / arXiv ID: 1010.6131 / 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 connection
@@ Property / cites work: Hardness and algorithms for rainbow connection / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection number and connected dominating sets
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in 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 @@
+Rainbow connections of graphs: a survey
@@ Property / cites work: Rainbow connections of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow Connection in Graphs with Minimum Degree Three
+Normal rank