Let G = G(n, m) be a rectangular solid grid graph and đ(G) be a minimum length Eulerian augmentation of G. Let l0, . . ., lt â â such that âti=0 li = |E(đ(G)|, where 2(n + m) †li = 2ki. In this paper, we exhibit a constructive procedure providing an edge-disjoint decomposition of đ (G) into closed trails T0, . . ., Tt such that |E(Ti)| = li.