Two sufficient conditions for a 2‐factor in a bipartite graph

Abstract

Abstract In this paper we prove that every 1‐tough bipartite graph which is not isomorphic to K 1,1 has a 2‐factor. We also obtain a sufficient condition for the existence of a 2‐factor in a bipartite graph, in the spirit of Hall's theorem.