Let G =(V_1,V_2,E) be a balanced bipartite graph with2 n vertices.The bipartite binding number of G,denoted by B(G),is defined to be n if G =K_n and min i∈{1,2}|N(S)| 3 / 2 and n 139,then G is bipancyclic.This paper generalizes the conclusion as follows:Let 0 < c < 3 / 2 and G be a 2-colmected balanced bipartite graph with 2n(n is large enough) vertices such that B(G) c and δ(G)(2-c)n/(3-c)+2/3.Then G is bipancyclic.
展开▼