A Note on the Existence of All (g,f)-Factors

Abstract

This paper is devoted to the problem of existence of all $(g,f)$-factors in a bipartite graph. We present an algorithm to test if a given bipartite graph contains all $(g,f)$-factors. In this way we give the affirmative answer to the question stated by Niessen. An analogous result for general graphs remains still unanswered.