On a Check-Digit Method Based On Graph Coloring

We propose a check-digit scheme that makes use of graph vertex coloring. It complements known schemes, which rather make use of the graph structure. Our scheme can be used simultaneously with them to compensate for mutual weaknesses. We show that feasibility of the proposed scheme increases with the size of the number whose digits are checked, and with the overall probability of digit errors.