Hamiltonian path

From: harry (harry_at_ba.ar)
Date: 08/01/04 

Date: 1 Aug 2004 00:31:41 GMT

Someone has a proof for:
If G = (V, E) is a graph with |V| >= 4, and d_min >= n-2 (d(v) >= n-2 for
every v in V), then G has a hamiltonian circuit.
?

Thanks!
Harry.