Upper bounds for the rainbow connection numbers of line graphs (Q1926059): Difference between revisions

@@ 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 @@
+W2055226535
@@ Property / OpenAlex ID: W2055226535 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0287
@@ Property / arXiv ID: 1001.0287 / 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 @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5668506
@@ Property / cites work: Q5668506 / 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 @@
+Clique coverings and partitions of line graphs
@@ Property / cites work: Clique coverings and partitions of line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3166468
@@ Property / cites work: Q3166468 / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow Connection in Graphs with Minimum Degree Three
+Normal rank