  It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order
$2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be
chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.
