Decomposition of bipartite graphs under degree constraints

Abstract

i = 1,2). The result generalizes a known characterization of bipartite graphs with a k-factor. Its proof uses flow theory and is a refinement of the proof of an analogous result due to Folkman and Fulkerson. By applying corresponding flow algorithms, the described decomposition can be found in polynomial time if it exists. As an application, an assignment problem is solved. o 7993 by ~o h n wi/ey & Sons, Inc.