graceful coloring of some corona graphs - an algorithmic approach

A graceful $k$-coloring of a non-empty graph g is a proper vertex coloring with $k$ colors that induces a proper edge coloring, where the color for an edge $uv$ is the absolute difference between the colors assigned to the vertices $u$ and $v$. the minimum $k$ for which $g$ admits a graceful $k$-coloring is called the graceful chromatic number of $g$ ($chi_ {g} (g)$). the problem of determining the graceful chromatic number for some corona graphs with the related coloring algorithms are studied in this paper.