Randomly r-orthogonal factorizations in bipartite graphs.

Let G be a graph with vertex set V(G) and edge set E(G), and let f be an integer-valued function defined on V(G). It is proved in this paper that every bipartite (0 , m f - m + 1) -graph has a (0, f)-factorization randomly r-orthogonal to n vertex-disjoint mr-subgraphs of G, which is a generalization of the known result with n = 1 given by Zhou and Wu. [ABSTRACT FROM AUTHOR]