Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-012-1183-x
@@ Property / DOI: 10.1007/s00373-012-1183-x / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.2641
@@ Property / arXiv ID: 1012.2641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / 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 @@
+Nordhaus-Gaddum inequalities for domination in graphs
+Normal rank
@@ Property / cites work @@
+The Diameter of a Graph and its Complement
@@ Property / cites work: The Diameter of a Graph and its Complement / 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 @@
+On Complementary Graphs
@@ Property / cites work: On Complementary Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3377651
@@ Property / cites work: Q3377651 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00373-012-1183-X
@@ Property / DOI: 10.1007/S00373-012-1183-X / rank @@
+Normal rank