3 citations · 7 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2003
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…
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…