Injective coloring of some graph operations (Q1659655): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of determining the rainbow vertex-connection of a graph
+Normal rank
@@ Property / cites work @@
+Injective colorings of sparse graphs
@@ Property / cites work: Injective colorings of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the injective chromatic number of graphs
@@ Property / cites work: On the injective chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Injective Colourings of Chordal Graphs
@@ Property / cites work: On Injective Colourings of Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Note on the hardness of rainbow connections for planar and line graphs
+Normal rank
@@ Property / cites work @@
+Rainbow connections for outerplanar graphs with diameter 2 and 3
+Normal rank
@@ Property / cites work @@
+The hyper-Wiener index of graph operations
@@ Property / cites work: The hyper-Wiener index of graph operations / rank @@
+Normal rank
@@ Property / cites work @@
+The strong rainbow vertex-connection of graphs
@@ Property / cites work: The strong rainbow vertex-connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in 3-connected graphs
@@ Property / cites work: Rainbow connection in 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the rainbow vertex-connection
@@ Property / cites work: On the rainbow vertex-connection / 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 @@
+Coloring the square of a \(K_{4}\)-minor free graph
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of the square of a planar graph
+Normal rank
@@ Property / cites work @@
+An improved upper bound for the neighbor sum distinguishing index of graphs
+Normal rank