论文部分内容阅读
Let G be a graph of order n. For graph to be Hamiltonian, beginning with Dirac’s classic result in 1952, Dirac’s theorem was followed by that of Ore in 1960. In 1984, Fan generalized Dirac’s theorem and Ore’s theorem as if G is a 2-connected graph of orde