  A graceful k-coloring of a non-empty graph $G=(V,E)$ is a proper vertex
coloring $f:V(G)\rightarrow\lbrace 1,2,...,k \rbrace$, $k\geq 2$, which induces
a proper edge coloring $f^{*}:E(G)\rightarrow\lbrace 1, 2, . . . , k-1 \rbrace
$ defined by $f^{*}(uv) = |f(u)-f(v)|$, where $u,v\in V(G)$. The minimum $k$
for which $G$ has a graceful $k$-coloring is called graceful chromatic number,
$\chi_{g}(G)$. The graceful chromatic number for a few variants of ladder
graphs are investigated in this article.
