D. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that if G is a 2-connected graph with n vertices such that d(u) + d(v) + d(w) >= n + κ holds for any triple of independent vertices u, v, and w, then G is hamiltonian, where κ is the vertex connectivity of G. In this note, we will give a short proof of the above result.
展开▼
机译：D. Bauer，HJ Broersma，R。Li和HJ Veldman证明，如果G是具有n个顶点的2连通图，则d（u）+ d（v）+ d（w）> = n +κ成立如果独立顶点u，v和w的任何三元组，则G是哈密顿量，其中κ是G的顶点连通性。在此注释中，我们将简要证明上述结果。
展开▼
