The problem of finding a Hamiltonian cycle in a graph is NP-complete (and therefore NP). This is a proven fact; it is not something that is under consideration (and so it will not change in the future).
having an algorithm that i want to code but i'm lazy. and if the question of NP=P was solved then there was no point =] guess that shoulda been my question but I just wanted to see if there was apaper out their that said H=P.
As master_coda has stated, Hamiltonian is "proved" to be NP-complete.
Now, if i understand your last post, then you seem to have an algorithm for Hamiltonian in which case you have solved the NP=P problem!! When are we going to see your paper coming out :D