Strong conflict-free connection of graphs (Q2284053): Difference between revisions

@@ 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 @@
+On conflict-free connection of graphs
@@ Property / cites work: On conflict-free connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-free connection of trees
@@ Property / cites work: Conflict-free connection of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow disconnection in graphs
@@ Property / cites work: Rainbow disconnection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-free vertex connection number at most 3 and size of graphs
+Normal rank
@@ Property / cites work @@
+Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
+Normal rank
@@ Property / cites work @@
+On strong proper connection number of cubic graphs
+Normal rank
@@ Property / cites work @@
+(Strong) conflict-free connectivity: algorithm and complexity
+Normal rank
@@ Property / cites work @@
+Conflict-free vertex-connections of graphs
@@ Property / cites work: Conflict-free vertex-connections of graphs / rank @@
+Normal rank