Conflict-free connection number of graphs with four bridges (Q6045132): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-023-02649-5
+Normal rank
@@ Property / OpenAlex ID @@
+W4365815340
@@ Property / OpenAlex ID: W4365815340 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / 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 @@
+Graphs with conflict-free connection number two
@@ Property / cites work: Graphs with conflict-free connection number two / 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 @@
+Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
+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 numbers of graphs with small diameters
+Normal rank
@@ Property / cites work @@
+Hardness results for three kinds of colored connections of graphs
+Normal rank
@@ Property / cites work @@
+Conflict-free connection number and size of graphs
+Normal rank
@@ Property / cites work @@
+On conflict-free connection of graphs
@@ Property / cites work: On conflict-free connection of graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6045132