We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Vertex coloring and multicoloring of graphs are a well known subject in graph theory, as well as their applications. In vertex multicoloring, each vertex is assigned some subset of a given set of colors. Here we propose a new kind of vertex multicoloring, motivated by the situation of sharing a secret and securing it from the actions of some number of attackers. We name the multicoloring a highly a-resistant vertex k-multicoloring, where a is the number of the attackers, and k the number of colors. For small values a we determine what is the minimal number of vertices a graph must have in order to allow such a coloring, and what is the minimal number of colors needed
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.