On a generalization of a theorem of Nash-Williams (Q1179465): Difference between revisions

Let \(G\) be a simple \(k\)-connected graph with \(\nu\geq 3\) vertices, minimum degree \(\delta\) and independence number \(\alpha\). The paper presents an alternative proof of the following theorem of Fraisse (1986): \(G\), as above, is Hamiltonian if \(\delta\geq\max\{\alpha+k-2,\;(1/(k+1))(\nu+k(k-1))\}\).