Let G be a connected graph with n vertices where n 3 Prove

Last updated: 5/21/2023

Let G be a connected graph with n vertices where n 3 Prove that if each vertex of G has degree at least n 1 2 then G contains a Hamiltonian cycle