Protasova, K.D.; Provotar, Т.М.
(Доповіді НАН України, 2012)
We give an algebraic characterization of rainbow graphs. A connected graph Γ is called rainbow
if there is a vertex coloring of Γ, which is bijective on the set of neighbors of each vertex of Γ.