We are going to use the notations introduced in our paper [1]*, § 2. A graph ~e is an ordered pair (g, G) where the elements of the sets g and G are the vertices and the edges of n respectively. We assume that the reader is familiar to the usual terminilogy of graph-theory. The aim of this paper is to consider two kinds of decompositions of graphs called vertexand edge-decompositions respectively .