A 2-rainbow dominating function (2RDF) of a graph G is a function F from the vertex set V(G) to the set of all subsets of the set {1, 2} such that for any vertex v Î V(G) with f(v)=Æ the condition ÈuÎN(v)f(u)={1, 2}is fulfilled, where N(v) is the open neighborhood of v. A maximal 2-rainbow dominating function on a graph G is a 2-rainbow dominating function f such that the set {wÎV(G)|f(w)=Æ} is not a dominating set of G. The weight of a maximal 2RDF f is the value w(f)=SvÎV|f(v)|. The maximal 2-rainbow domination number of a graph G, denoted by gmr(G), is the the minimum weight of a maximal 2RDF of G. In this paper, we continue the study of maximal 2-rainbow domination number. We characterize all graphs G of order n whose maximal 2-rainbow domination number is equal to 2 or 3. Finally, we characterize all graphs G of order n with g(G)³5 for which gm2r=n-2.