Another cycle structure theorem for Hamiltonian graphs (Q1297455): Difference between revisions

This paper shows that for a Hamiltonian graph \(G\) of order \(n\), if non-adjacent vertices \(x\) and \(y\) of distance 2 on a Hamiltonian cycle satisfy \(d(x)+d(y)\geq n\), then \(G\) is either pancyclic or bipartite except only for the \(n-1\)-cycle and the 3-cycle \((d(x)\) is the degree of \(x\) and \(d(y)\) of \(y\)).