Hamiltonian cycles and paths through matchings

We give sufficient degree-sum conditions for a graph to contain every matching in a hamiltonian cycle or a hamiltonian path. Moreover we prove that some results are almost best possible.