On garlands in $\chi$-uniquely colorable graphs

A graph $G$ is called $\chi$-uniquely colorable, if all its $\chi$-colorings induce the same partion of the vertex set into one-color components. For $\chi$-uniquely colorable graphs new bound of the number of vertex set partions into $\chi + 1$ cocliques is found.