A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs

Bing Wei
1999 Journal of combinatorial theory. Series B (Print)  
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. Academic Press
doi:10.1006/jctb.1998.1867 fatcat:6473xlvr5jfbhje7tvz34hw6dm