A degree characterisation of pancyclicity

A graph G of order n is said to be in the class O(n ? 1) if deg(u) + deg(?) ? n ? 1 for every pair of nonadjacent vertices u, ? ? V(G). We characterise the graphs in O(n ? 1) which are pancyclic.