%0 Journal Article
%T Kaleidoscopical graphs and semigroups
%A K. D. Protasova
%J Matematychni Studii
%D 2011
%I Lviv Mathematical Society, VNTL Publishers
%X We give a semigroup characterization of kaleidoscopical graphs. A connected graph งค (considered as a metric space with the path metric) is called kaleidoscopical if there is a vertex coloring of งค which is bijective on each unit ball.
%K graphs
%K semigroups
%U http://matstud.org.ua/texts/2011/36_1/3-5.pdf