A condition for a Hamiltonian bipartite graph to be bipancyclic (Q1193443)

A bipartite graph of order \(2n\) is said to be bipancyclic if it contains a cycle of length \(2\ell\), for each \(\ell\), \(2\leq\ell\leq n\). The author proves the following result: Let \(G\) be a Hamiltonian bipartite graph of order \(2n\), and let \(C=x_ 1y_ 1x_ 2y_ 2\dots x_ ny_ nx_ 1\) be a Hamiltonian cycle of \(G\). If \(d(x_ 1)+d(x_ 2)\geq n+1\), then \(G\) is either: (1) bipancyclic, (2) missing an 4-cycle, (3) missing a \((n+1)\)-cycle.