Minimum degree condition for proper connection number 2 (Q2424876): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.04.042
+Normal rank
@@ Property / OpenAlex ID @@
+W2414388691
@@ Property / OpenAlex ID: W2414388691 / 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 @@
+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 @@
+Proper connection numbers of complementary graphs
@@ Property / cites work: Proper connection numbers of complementary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection number and connected dominating sets
+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 @@
+Panconnected graphs. II
@@ Property / cites work: Panconnected graphs. II / rank @@
+Normal rank