Abstract:Let G be a bipartlte graph and Íï, gi be nonnegative integer-valued functlons defined on the vertlces set V (G) of G and gi (x)ζfi (x) for all xεV(G) l~i~m. If the edges of bipartlte graph G can be decomposed into m edge disjoint [酌, f1 J-factor 矶,…, [gm , fmJ-factor Fm.then F={Fp …, Fm }is called a [gi , fJï'-factorizatlOn of bipartlte graph G , in addition , if H is a subgraph with m edges in bipartlte graph G and I E (H) n E (Fi) I = 1 for all 1ζiζm , then we call that F is orthogonal to H. This paper mainly studies orthogonal factorization of bipartlte graph and gives one result.