A degree condition implying that every matching is contained in a hamiltonian cycle

We give a degree sum condition for three independent vertices under which every matching of a graph lies in a hamiltonian cycle. We also show that the bound for the degree sum is almost the best possible.