On two conjectures about the proper connection number of graphs (Q2359964): Difference between revisions

@@ Property / arXiv ID @@
+.07163
@@ Property / arXiv ID: 1602.07163 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2829346
@@ Property / cites work: Q2829346 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection of graphs
@@ Property / cites work: Proper connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum degree conditions for the proper connection number of graphs
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection number of random graphs
@@ Property / cites work: Proper connection number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum degree condition for proper connection number 2
+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 @@
+Rainbow connections of graphs: a survey
@@ Property / cites work: Rainbow connections of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection number and connected dominating sets
+Normal rank
@@ Property / cites work @@
+Q3808121
@@ Property / cites work: Q3808121 / rank @@
+Normal rank