Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789): Difference between revisions

@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection of graphs
@@ Property / cites work: Proper connection of graphs / rank @@
+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 @@
+Proper connection numbers of complementary graphs
@@ Property / cites work: Proper connection numbers of complementary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the total proper connection of graphs
@@ Property / cites work: On the total proper connection of 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 @@
+On Complementary Graphs
@@ Property / cites work: On Complementary Graphs / rank @@
+Normal rank