In this paper, we identify LOW and OLW graphs, find the minimum for decomposition of , into these graphs, and show that for all viable values of , the necessary conditions are sufficient for LOW- and OLW-decompositions using cyclic decompositions from base graphs.