  In a paired threshold graph, each vertex has a weight, and two vertices are
adjacent if their weight sum is large enough and their weight difference is
small enough. It generalizes threshold graphs and unit interval graphs, both
very well studied. We present a vertex ordering characterization of this graph
class, which enables us to prove that it is a subclass of interval graphs.
Further study of clique paths of paired threshold graphs leads to a simple
linear-time recognition algorithm for the class.
