Abstract
Two-fold factorization of a graph H is a combination C = {G(v) : v is an element of V(H)} of vertical bar V (H)vertical bar subgraphs of H where every edge of H is found precisely in two elements of C and for any two elements G(u) and G(v) in C, vertical bar E(G(u)) boolean AND E(G(v)) vertical bar is 1 if u and v are adjacent in H and it is 0 if u and v are nonadjacent in H. This paper constructs two-fold factorizations of the complete bipartite graphs by a given infinite graph classes.