New sufficient conditions for bipancyclic bipartite graphs

We give here two sufficient conditions for a bipartite balanced graph of order 2n to be bipancyclic. The first one concerns graphs that satisfy a ''bipartite Ore's condition'', that is graphs such that any two nonadjacent vertices in both parts of the bipartition have degree sum at least n, and the second one is for bipartite balanced traceable graphs containing an hamiltonian path whose extremities are nonadjacent and have degree sum at least n+1.

[1]  Odile Favaron,et al.  The complete closure of a graph , 1993, J. Graph Theory.

[2]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[3]  O. Ore.  Note on Hamilton Circuits , 1960 .

[4]  Edward F. Schmeichel,et al.  Bipartite graphs with cycles of all even lengths , 1982, J. Graph Theory.

[5]  J. Moon,et al.  On Hamiltonian bipartite graphs , 1963 .

[6]  J. Bondy,et al.  Pancyclic graphs II , 1971 .

[7]  John Adrian Bondy,et al.  A method in graph theory , 1976, Discret. Math..

[8]  Denise Amar,et al.  Biclosure and bistability in a balanced bipartite graph , 1995, J. Graph Theory.

[9]  Odile Favaron,et al.  Pancyclism and small cycles in graphs , 1996, Discuss. Math. Graph Theory.

[10]  André Raspaud,et al.  Hamiltonian properties and the bipartite independence number , 1996, Discret. Math..