  The applications of graph coloring are diverse and many so lots of new types
of coloring are being proposed and explored. Here we define a safe k-coloring,
motivated by the application of coloring to secret sharing. Secret sharing is a
way of securing a secret from a number of attackers by dividing it into parts
and then distributing those parts to some persons, represented here by graph
vertices. Parts of the secret are represented by colors which are then assigned
to the vertices under certain conditions, making a coloring safe if a
predetermined number of attackers cannot read the whole secret, nor disable the
rest of the group from doing so. We observe a fixed number of colors, namely 3,
and analyze what kind of graphs have a safe 3-coloring.
