A difference vertex labeling of a graph G an assignment of labels to the vertex of G that induces for each edge xy the weight | (x) - (y)|. A difference vertex labeling of a graph G of size n is odd-graceful if is an injection from V(G) to {0, 1, 2, …, 2q-1} such that the induced weights are {1, 3, 5, …, 2q-1}. In this paper, we present odd graceful labelings of some graphs. In particular we show, odd graceful labelings of the kC4- snakes ( for the general case), kC8 and kC12- snakes ( for even case). We also prove that the linear kCn- snakes is odd graceful if and only if n and k are even