I have recently stumbled into the four color theorem and did some research on the internet to learn about previous attempts to prove it. I found the following statement on Wikibooks:

[URL [Broken] here for full text)[/url]

I do not quite understand what Hamiltonian cycles have to do with it - doesn't the fact that every vertex in a graph representing a map can have no more than 3 edges already prove the four color theorem?