Tight upper bound of the rainbow vertex-connection number for 2-connected graphs ?
The rainbow vertex-connection number , rvc(G) r v c ( G ) , of a connected graph G G is the minimum number of colors needed to color its vertices such that every pair of vertices is connected by at least one path whose internal vertices have distinct colors. In this paper we prove that for a 2-connected graph G G of order n n ,
rainbow vertex-connection number 2-connected graph rainbow vertex coloring ear decomposition