Applying a condition for a Hamiltonian bipartite graph to be bipancyclic (Q686432): Difference between revisions

Let \(G\) denote a connected \(n\times n\) bipartite graph. The author shows, among other things, that if whenever the distance between two vertices \(x\) and \(y\) is at least \(n+1\), then \(G\) is bipartite.