3 citations · 7 across the 5 of their papers we have counts for
5 papers
The upper bound on number of graphs, with fixed number of vertices, that vertices can be colored with n colors
Kamil Kulesza, Zbigniew Kotulski
In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colo…
Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography
Kamil Kulesza, Zbigniew Kotulski
At the beginning some results from the field of graph theory are presented. Next we show how to share a secret that is proper n-coloring of the graph, with the known structure. The…
On secret sharing for graphs
Kamil Kulesza, Zbigniew Kotulski
In the paper we discuss how to share the secrets, that are graphs. So, far secret sharing schemes were designed to work with numbers. As the first step, we propose conditions for "…
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…
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…