3 citations · 12 across the 9 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
math.CO2002★ 3 cited
On graph coloring check-digit method
Kamil Kulesza, Zbigniew Kotulski
We show a method how to convert any graph into the binary number and vice versa. We derive upper bound for maximum number of graphs, that, have fixed number of vertices and can be…
cs.CR2002★ 1 cited
On the graph coloring check-digit scheme with applications to verifiable secret sharing
Kamil Kulesza, Zbigniew Kotulski
In the paper we apply graph vertex coloring for verification of secret shares. We start from showing how to convert any graph into the number and vice versa. Next, theoretical resu…