A survey on rainbow (vertex-)index of graphs

05C05: Trees

05C15: Coloring of graphs and hypergraphs

05C40: Connectivity

Cites Work

Unnamed Item
Unnamed Item
The 3-rainbow index and connected dominating sets
Note on the upper bound of the rainbow index of a graph
Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
Rainbow colouring of split graphs
Further hardness results on the rainbow vertex-connection number of graphs
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
Hardness and algorithms for rainbow connection
The complexity of determining the rainbow vertex-connection of a graph
The vertex-rainbow index of a graph
Rainbow connection number and radius
Further hardness results on rainbow and strong rainbow connectivity
On rainbow connection
On the complexity of rainbow coloring problems
Rainbow connections of graphs: a survey
Note on the vertex-rainbow index of a graph
Fine-grained complexity of rainbow coloring and its variants
The 3-rainbow index of a graph
More on the minimum size of graphs with given rainbow index
Note on the hardness of rainbow connections for planar and line graphs
The complexity of determining the vertex-rainbow index of graphs
Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs
Some upper bounds for 3-rainbow index of graphs
New Hardness Results in Rainbow Connectivity
Rainbow Colouring of Split and Threshold Graphs
Inapproximability of Rainbow Colouring
Generalized Connectivity of Graphs
Rainbow trees in graphs and generalized connectivity
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
On the Fine-Grained Complexity of Rainbow Coloring
Rainbow connection in graphs
Steiner distance in graphs
The minimum size of graphs with given rainbow index
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
On the complexity of \(k\)-SAT