Protasov, I.V.; Protasova, K.D.
(Algebra and Discrete Mathematics, 2007)
A regular connected graph Γ of degree s is called
kaleidoscopical if there is a (s + 1)-coloring of the set of its vertices such that every unit ball in Γ has no distinct monochrome
points. The kaleidoscopical graphs can ...