A Note on the Existence of All (g,f)-Factors Radosław Cymer Vol. 21, no. 4, pp. 555-560, 2017. Concise paper. 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. Submitted: February 2017. Accepted: March 2017. Final: March 2017. Published: April 2017. Communicated by Giuseppe Liotta article (PDF) BibTeX