Conflict-free (vertex)-connection numbers of graphs with small diameters (Q5109070): Difference between revisions

@@ label / en / label / en @@
+Conflict-free (vertex)-connection numbers of graphs with small diameters
@@ Property / author @@
-Xue Liang Li
@@ Property / author: Xue Liang Li / rank @@
-Normal rank
@@ Property / author @@
+Xue Liang Li
@@ Property / author: Xue Liang Li / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv classification @@
+math.CO
@@ Property / arXiv classification: math.CO / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.10881
@@ Property / arXiv ID: 1902.10881 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with conflict-free connection number two
@@ Property / cites work: Graphs with conflict-free connection number two / 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 @@
+Conflict-free connections of graphs
@@ Property / cites work: Conflict-free connections of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-free connection numbers of line graphs
@@ Property / cites work: Conflict-free connection numbers of line 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 @@
+Erd\"os-Gallai-type results for conflict-free connection of graphs
+Normal rank
@@ Property / cites work @@
+Strong conflict-free connection of graphs
@@ Property / cites work: Strong conflict-free connection of graphs / rank @@
+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