A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs (Q1306429): Difference between revisions

\textit{D. Bauer}, \textit{H. J. Broersma}, \textit{H. J. Veldman} and \textit{Li Rao} [J. Comb. Theory, Ser. B 47, No. 2, 237-243 (1989; Zbl 0634.05053)] proved that if \(G\) is a 2-connected graph with \(n\) vertices such that \(d(u)+ d(v)+ d(w)\geq n+\kappa\) holds for any triple of independent vertices \(u\), \(v\), and \(w\), then \(G\) is Hamiltonian, where \(\kappa\) is the vertex connectivity of \(G\). We give a short proof of the above result. \(\copyright\) Academic Press.