Bipartite Graph Partition Problems into Cycles

Abstract

Abstract???In this article, we consider the following problem???Given a bipartite graph G and a positive integer k, when does G contain exactly k vertex-disjoint cycles? We will prove that if G=(V1, V2, E) is a bipartite graph with |V1|=|V2|=n≥2k+1 and δ1.1(G)≥2[n/2]+2, then G contains exactly k vertex-disjoint cycles.