×

A sufficient condition on degree sums of independent triples for Hamiltonian cycles in 1-tough graphs. (English) Zbl 0764.05050

Authors’ abstract: We prove that if \(G\) is a 1-tough graph with \(n=| V(G)|\geq 13\) such that the degree sum of any three independent vertices is at least \((3n-14)/2\), then \(G\) is Hamiltonian.

MSC:

05C45 Eulerian and Hamiltonian graphs
PDFBibTeX XMLCite