RE: [PrimeNumbers] Hamiltonian circuits
>Jon: Do you claim anything beyond what was known toMy Graph Theory book states every graph with n>=3 vertices has a HC if the
>Gabriel Andrew Dirac in 1952?
minimum degree is n/2 (Dirac 1952)
Goto Books, Graph Theory, and you can download it for free (p.223)
(The download says GraphTheoryII, I have Graph Theory, as in the picture, I
think the II is refering to 'second edition')