Do hamiltonian paths exist on n-valent, simple, connected, planar graphs, where n>2?

36 Views Asked by At

I don't know to much about graph theory, so was wondering about the posted question. If it is too much perhaps you may know the answer if n is even? Any help is appreciated. Also, this is my first time posting here so if I've done something that is not proper etiquette, please tell me.