Let G = (V_1,V_2,E) be a balanced bipartite graph with 2n vertices. The bipartite binding number of G, denoted by B(G), is defined to be n if G =K_n and min min | N(S) | / | S | otherwise. We call G bipancyclic if it contains a cycle of every even length m for 4≤m≤2n. A theorem showed that if G is a balanced bipartite graph with 2n vertices, B(G)>3 / 2 and n≥139, then G is bipancyclic. This paper generalizes the conclusion as follows: Let 0
