THE COLORING OF THE TREE OF COLORINGS

In the present paper, we continue the investigation of a relation between trees and colorings that was introduced in [1]. In [1], two mappings were defined: a function C bar right arrow T(C) assigns to each coloring a tree, and a function (T, e) bar right arrow C(T, e) assigns to each tree with an enumeration a coloring. Here we show that the coloring C is not reconstructable from T(C), although the tree T is reconstructable from C(T, e), under certain restrictions on T and e.